mlsanityData to 7 Oct 2026

Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy

arXiv 1905.10477 ↗First posted 24 May 2019cs.DS cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

We give a simple, computationally efficient, and node-differentially-private algorithm for estimating the parameter of an Erdos-Renyi graph---that is, estimating p in a G(n,p)---with near-optimal accuracy. Our algorithm nearly matches the information-theoretically optimal exponential-time algorithm for the same problem due to Borgs et al. (FOCS 2018). More generally, we give an optimal, computationally efficient, private algorithm for estimating the edge-density of any graph whose degree distribution is concentrated on a small interval.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 4; 2023: 2; 2024: 3; 2025: 2; 2026: 1.

13 papers.

Sort: