Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
<|reference_start|>Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust: We give the first polynomial-time, differentially node-private, and robust algorithm for estimating the edge density of Erd\H{o}s-R\'enyi random graphs and their generalization, inhomogeneous random graphs. We further prove information-theoretical lower bounds, showing that the error rate of our algorithm is optimal up to logarithmic factors. Previous algorithms incur either exponential running time or suboptimal error rates.   Two key ingredients of our algorithm are (1) a new sum-of-squares algorithm for robust edge density estimation, and (2) the reduction from privacy to robustness based on sum-of-squares exponential mechanisms due to Hopkins et al. (STOC 2023).<|reference_end|>
@article{chen2024private,
    title={Private Edge Density Estimation for Random Graphs: Optimal, Efficient
  and Robust},
    author={Hongjie Chen, Jingqiu Ding, Yiding Hua, David Steurer},
    journal={arXiv preprint arXiv:2405.16663},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.16663},
    primaryClass={cs.DS cs.LG stat.ML}
}