Node-Differentially Private Estimation of the Number of Connected Components
Summary: First poly-time node-DP algorithm to approximate the number of connected components with additive error Õ(Δ* ln ln n / ε), where Δ* is the minimum possible max-degree of a spanning forest. Uses efficient Lipschitz extensions via the forest polytope and a combinatorial no-Δ-star ⇒ Δ-bounded spanning-forest bound, yielding near-optimal l_∞ error on monotone graph families. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Iden Kalemaj (Boston University)
- 2. Sofya Raskhodnikova (Boston University)
- 3. Adam Smith (Boston University)
- 4. Charalampos E. Tsourakakis (Boston University)
BibTeX Citation
@inproceedings{kalemaj_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Node-Differentially Private Estimation of the Number of Connected Components}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588671},
doi = {10.1145/3584372.3588671},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kalemaj, Iden and Raskhodnikova, Sofya and Smith, Adam and Tsourakakis, Charalampos E.},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,826 | Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy | 2025 | PODS | 5.7621757e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 836 | Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins | 2013 | SIGMOD | 0.00013715654 |
| 1,220 | Calibrating Data to Sensitivity in Private Data Analysis: A Platform for Differentially-Private Analysis of Weighted Datasets | 2014 | VLDB | 0.00011619529 |
| 1,790 | Publishing Graph Degree Distribution with Node Differential Privacy | 2016 | SIGMOD | 9.7502278e-05 |
| 1,960 | Private Release of Graph Statistics using Ladder Functions | 2015 | SIGMOD | 9.4058693e-05 |
| 7,338 | DPGraph: A Benchmark Platform for Differentially Private Graph Analysis | 2021 | SIGMOD | 5.6393827e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,387 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB |
| 2 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 3 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 4 | 6,826 | Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy | 2025 | PODS |
| 5 | 11,105 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB |
| 6 | 596 | Private Analysis of Graph Structure | 2011 | VLDB |
| 7 | 10,158 | Improved Lower Bounds for Privacy under Continual Release | 2026 | PODS |
| 8 | 6,367 | Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy | 2025 | SIGMOD |
| 9 | 3,948 | Shortest Paths and Distances with Differential Privacy | 2016 | PODS |
| 10 | 9,538 | Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation | 2025 | PODS |