most citedPrivate Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2024★ 1 cited

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust

Hongjie Chen, Jingqiu Ding, Yiding Hua +1

We give the first polynomial-time, differentially node-private, and robust algorithm for estimating the edge density of Erdős-Rényi random graphs and their generalization, inhomoge…