We present an algorithm for releasing graphical degree sequences of simple undirected graphs under the framework of differential privacy. The algorithm is designed to provide utility for statistical inference in random graph models whose sufficient statistics are functions of degree sequences. Specifically, we focus on the tasks of existence of maximum likelihood estimates, parameter estimation and goodness-of-fit testing for the beta model of random graphs. We show the usefulness of our algorithm by evaluating it empirically on simulated and real-life datasets. As the released degree sequence is graphical, our algorithm can also be used to release synthetic graphs under the beta model. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Karwa, V., & Slavković, A. B. (2012). Differentially private graphical degree sequences and synthetic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7556 LNCS, pp. 273–285). Springer Verlag. https://doi.org/10.1007/978-3-642-33627-0_21
Mendeley helps you to discover research relevant for your work.