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
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,348 | Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy | 2025 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 1,177 | Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins | 2013 | SIGMOD | 0.00013470212 |
| 1,602 | Calibrating Data to Sensitivity in Private Data Analysis: A Platform for Differentially-Private Analysis of Weighted Datasets | 2014 | VLDB | 0.00011199166 |
| 2,226 | Publishing Graph Degree Distribution with Node Differential Privacy | 2016 | SIGMOD | 9.2421776e-05 |
| 2,683 | Private Release of Graph Statistics using Ladder Functions | 2015 | SIGMOD | 8.315553e-05 |
| 7,940 | DPGraph: A Benchmark Platform for Differentially Private Graph Analysis | 2021 | SIGMOD | 4.613363e-05 |
Previous
Page 1 / 1
Next