Exponential random graph estimation under differential privacy

The effective analysis of social networks and graph-structured data is often limited by the privacy concerns of individuals whose data make up these networks. Differential privacy offers individuals a rigorous and appealing guarantee of privacy. But while differentially private algorithms for computing basic graph properties have been proposed, most graph modeling tasks common in the data mining community cannot yet be carried out privately. In this work we propose algorithms for privately estimating the parameters of exponential random graph models (ERGMs). We break the estimation problem into two steps: computing private sufficient statistics, then using them to estimate the model parameters. We consider specific alternating statistics that are in common use for ERGM models and describe a method for estimating them privately by adding noise proportional to a high-confidence bound on their local sensitivity. In addition, we propose an estimation algorithm that considers the noise distribution of the private statistics and offers better accuracy than performing standard parameter estimation using the private statistics.

[1]  Sofya Raskhodnikova,et al.  Private analysis of graph structure , 2011, Proc. VLDB Endow..

[2]  Zoubin Ghahramani,et al.  MCMC for Doubly-intractable Distributions , 2006, UAI.

[3]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[4]  Bing-Rong Lin,et al.  An Axiomatic View of Statistical Privacy and Utility , 2012, J. Priv. Confidentiality.

[5]  C. Geyer,et al.  Constrained Monte Carlo Maximum Likelihood for Dependent Data , 1992 .

[6]  Sofya Raskhodnikova,et al.  Smooth sensitivity and sampling in private data analysis , 2007, STOC '07.

[7]  Moni Naor,et al.  Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.

[8]  Simon J. Godsill,et al.  Marginal maximum a posteriori estimation using Markov chain Monte Carlo , 2002, Stat. Comput..

[9]  Matthew D. Lieberman,et al.  Birds of a feather , 1994, Nature Structural Biology.

[10]  Bruce A. Desmarais,et al.  Inferential Network Analysis with Exponential Random Graph Models , 2011, Political Analysis.

[11]  Tom A. B. Snijders,et al.  Markov Chain Monte Carlo Estimation of Exponential Random Graph Models , 2002, J. Soc. Struct..

[12]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[13]  Matthew E. Brashears,et al.  Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications , 2014 .

[14]  P. Pattison,et al.  New Specifications for Exponential Random Graph Models , 2006 .

[15]  Sharon Goldberg,et al.  Calibrating Data to Sensitivity in Private Data Analysis , 2012, Proc. VLDB Endow..

[16]  Yang Xiang,et al.  On Learning Cluster Coefficient of Private Networks , 2012, ASONAM.

[17]  Shuigeng Zhou,et al.  Recursive mechanism: towards node differential privacy and unrestricted joins , 2013, SIGMOD '13.

[18]  Cynthia Dwork,et al.  Differential privacy and robust statistics , 2009, STOC '09.

[19]  N. Weiss.  A Course in Probability , 2005 .

[20]  Christos Faloutsos,et al.  Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..

[21]  J. Besag.  Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[22]  Arnaud Doucet,et al.  Particle methods for maximum likelihood estimation in latent variable models , 2008, Stat. Comput..

[23]  Rebecca N. Wright,et al.  A differentially private estimator for the stochastic Kronecker graph model , 2012, EDBT-ICDT '12.

[24]  G. Glauberman.  Proof of Theorem A , 1977 .

[25]  David D. Jensen,et al.  Accurate Estimation of the Degree Distribution of Private Networks , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[26]  Ben Y. Zhao,et al.  Sharing graphs using differentially private graph models , 2011, IMC '11.

[27]  D. Hunter,et al.  Inference in Curved Exponential Family Models for Networks , 2006 .

[28]  David R. Hunter,et al.  Curved exponential family models for social networks , 2007, Soc. Networks.

[29]  B. E. Eckbo,et al.  Appendix , 1826, Epilepsy Research.

[30]  Yang Xiang,et al.  On learning cluster coefficient of private networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[31]  Sofya Raskhodnikova,et al.  Analyzing Graphs with Node Differential Privacy , 2013, TCC.

[32]  S. E. Ahmed,et al.  Markov Chain Monte Carlo: Stochastic Simulation for Bayesian Inference , 2008, Technometrics.

[33]  S. Goodreau,et al.  Birds of a feather, or friend of a friend? using exponential random graph models to investigate adolescent social networks* , 2009, Demography.

[34]  Peng Wang,et al.  Recent developments in exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[35]  Avrim Blum,et al.  Differentially private data analysis of social networks via restricted sensitivity , 2012, ITCS '13.

[36]  Alberto Caimo,et al.  Bayesian inference for exponential random graph models , 2010, Soc. Networks.