Exponential random graph estimation under differential privacy

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2014, Pages 921-930

  Lu, Wentian ^a   Miklau, Gerome ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

differential privacy; exponential random graph model

Indexed keywords

EID: 84907033180     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623683     Document Type: Conference Paper

References (32)

1. J. Besag. Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society. Series B (Methodological), 1974.
2. J. Blocki, A. Blum, A. Datta, and O. Sheffet. Differentially private data analysis of social networks via restricted sensitivity. In ITCS, 2013.
3. A. Caimo and N. Friel. Bayesian inference for exponential random graph models. Social Networks, 33(1):41-55, 2011.
4. S. Chen and S. Zhou. Recursive mechanism: towards node differential privacy and unrestricted joins. In SIGMOD, 2013.
5. S. J. Cranmer and B. A. Desmarais. Inferential network analysis with exponential random graph models. Political Analysis, 19(1):66-86, 2011.
6. A. Doucet, S. J. Godsill, and C. P. Robert. Marginal maximum a posteriori estimation using markov chain monte carlo. Statistics and Computing, 2002.
7. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our data, ourselves: Privacy via distributed noise generation. EUROCRYPT, 2006.
8. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. Theory of Cryptography, 2006.
9. D. Gamerman and H. F. Lopes. Markov chain Monte Carlo: stochastic simulation for Bayesian inference, volume 68. CRC Press, 2006.
10. C. J. Geyer and E. A. Thompson. Constrained monte carlo maximum likelihood for dependent data. Journal of the Royal Statistical Society., 1992.
11. S. M. Goodreau, J. A. Kitts, and M. Morris. Birds of a feather, or friend of a friend? using exponential random graph models to investigate adolescent social networks*. Demography, 46(1):103-125, 2009.
12. M. Hay, C. Li, G. Miklau, and D. Jensen. Accurate estimation of the degree distribution of private networks. In ICDM, 2009.
13. D. Hunter. Curved exponential family models for social networks. Social Networks, 29(2):216-230, 2007.
14. D. Hunter and M. Handcock. Inference in curved exponential family models for networks. Journal of Computational and Graphical Statistics, 2006.
15. A. M. Johansen, A. Doucet, and M. Davy. Particle methods for maximum likelihood estimation in latent variable models. Statistics and Computing, 2008.
16. V. Karwa, S. Raskhodnikova, A. Smith, and G. Yaroslavtsev. Private analysis of graph structure. In VLDB, 2011.
17. S. P. Kasiviswanathan, K. Nissim, S. Raskhodnikova, and A. Smith. Analyzing graphs with node differential privacy. In TCC, 2013.
18. D. Kifer and B.-R. Lin. An axiomatic view of statistical privacy and utility. Journal of Privacy and Confidentiality, 2012.
19. J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani. Kronecker graphs: An approach to modeling networks. JMLR, 2010.
20. W. Lu and G. Miklau. Exponential random graph estimation under differential privacy. In arXiv, 2014.
21. D. Lusher, J. Koskinen, and G. Robins. Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications. Structural Analysis in the Social Sciences. Cambridge University Press, 2012.
22. D. Mir and R. N. Wright. A differentially private estimator for the stochastic kronecker graph model. In EDBT/ICDT Workshops, 2012.
23. I. Murray, Z. Ghahramani, and D. MacKay. Mcmc for doubly-intractable distributions. arXiv, 2012.
24. M. Newman. Networks: an introduction. Oxford University Press, 2010.
25. K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC, 2007.
26. D. Proserpio, S. Goldberg, and F. McSherry. Calibrating data to sensitivity in private data analysis. In VLDB, 2014.
27. G. Robins, T. Snijders, P. Wang, M. Handcock, and P. Pattison. Recent developments in exponential random graph p* models for social networks. Social networks, 2007.
28. A. Sala, X. Zhao, C. Wilson, H. Zheng, and B. Zhao. Sharing graphs using differentially private graph models. In SIGCOMM, 2011.
29. T. Snijders. Markov chain monte carlo estimation of exponential random graph models. Journal of Social Structure, 2002.
30. T. A. Snijders, P. E. Pattison, G. L. Robins, and M. S. Handcock. New specifications for exponential random graph models. Sociological methodology, 2006.
31. Y. Wang, X. Wu, J. Zhu, and Y. Xiang. On learning cluster coefficient of private networks. Social network analysis and mining, 2013.
32. N. A. Weiss, P. T. Holmes, and M. Hardy. A course in probability. Pearson Addison Wesley, 2006.