English

Sharing Social Network Data: Differentially Private Estimation of Exponential-Family Random Graph Models

Computation 2016-09-26 v2 Cryptography and Security Social and Information Networks Applications

Abstract

Motivated by a real-life problem of sharing social network data that contain sensitive personal information, we propose a novel approach to release and analyze synthetic graphs in order to protect privacy of individual relationships captured by the social network while maintaining the validity of statistical results. A case study using a version of the Enron e-mail corpus dataset demonstrates the application and usefulness of the proposed techniques in solving the challenging problem of maintaining privacy \emph{and} supporting open access to network data to ensure reproducibility of existing studies and discovering new scientific insights that can be obtained by analyzing such data. We use a simple yet effective randomized response mechanism to generate synthetic networks under ϵ\epsilon-edge differential privacy, and then use likelihood based inference for missing data and Markov chain Monte Carlo techniques to fit exponential-family random graph models to the generated synthetic networks.

Keywords

Cite

@article{arxiv.1511.02930,
  title  = {Sharing Social Network Data: Differentially Private Estimation of Exponential-Family Random Graph Models},
  author = {Vishesh Karwa and Pavel N. Krivitsky and Aleksandra B. Slavković},
  journal= {arXiv preprint arXiv:1511.02930},
  year   = {2016}
}

Comments

Updated, 39 pages

R2 v1 2026-06-22T11:41:06.607Z