Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy

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...

Full description

Bibliographic Details
Main Authors: Adam Sealfon, Jonathan Ullman
Format: Article
Language:English
Published: Labor Dynamics Institute 2021-02-01
Series:The Journal of Privacy and Confidentiality
Subjects:
Online Access:http://www.journalprivacyconfidentiality.org/index.php/jpc/article/view/745