Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy

05/24/2019
by   Adam Sealfon, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2022

A Simple Differentially Private Algorithm for Global Minimum Cut

In this note, we present a simple differentially private algorithm for t...
research
03/03/2022

Private High-Dimensional Hypothesis Testing

We provide improved differentially private algorithms for identity testi...
research
08/20/2023

Improved Differentially Private Densest Subgraph: Local and Purely Additive

We study the Densest Subgraph problem under the additional constraint of...
research
01/31/2020

Efficient Differentially Private F_0 Linear Sketching

A powerful feature of linear sketches is that from sketches of two data ...
research
03/10/2018

Graph-based Clustering under Differential Privacy

In this paper, we present the first differentially private clustering me...
research
04/13/2023

A Polynomial Time, Pure Differentially Private Estimator for Binary Product Distributions

We present the first ε-differentially private, computationally efficient...
research
02/28/2018

INSPECTRE: Privately Estimating the Unseen

We develop differentially private methods for estimating various distrib...

Please sign up or login with your details

Forgot password? Click here to reset