Inference using noisy degrees: Differentially private $\beta$-model and synthetic graphs
Vishesh Karwa, Aleksandra Slavkovi\'c

TL;DR
This paper develops differentially private methods for the $eta$-model of random graphs, enabling accurate inference and synthetic graph generation from noisy degree data while maintaining privacy.
Contribution
It introduces a private estimator for the $eta$-model, characterizes conditions for MLE existence, and provides algorithms for synthetic graph release with theoretical guarantees.
Findings
Private estimator is consistent and asymptotically normal.
The private method outperforms existing algorithms in real data.
The approach enables accurate, private inference from noisy degrees.
Abstract
The -model of random graphs is an exponential family model with the degree sequence as a sufficient statistic. In this paper, we contribute three key results. First, we characterize conditions that lead to a quadratic time algorithm to check for the existence of MLE of the -model, and show that the MLE never exists for the degree partition -model. Second, motivated by privacy problems with network data, we derive a differentially private estimator of the parameters of -model, and show it is consistent and asymptotically normally distributed - it achieves the same rate of convergence as the nonprivate estimator. We present an efficient algorithm for the private estimator that can be used to release synthetic graphs. Our techniques can also be used to release degree distributions and degree partitions accurately and privately, and to perform inference from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
