References
- Amaral, L. A. N., A. Scala, M. Barthelemy, and H. E. Stanley. 2000. Classes of small-world networks. Proceedings of the National Academy of Sciences 97 (21):11149–52. doi:https://doi.org/10.1073/pnas.200327197.
- Chatterjee, S., and P. Diaconis. 2013. Estimating and understanding exponential random graph models. The Annals of Statistics 41 (5):2428–61. doi:https://doi.org/10.1214/13-AOS1155.
- Chatterjee, S., P. Diaconis, and A. Sly. 2011. Random graphs with a given degree sequence. The Annals of Applied Probability 21 (4):1400–35. doi:https://doi.org/10.1214/10-AAP728.
- Dwork, C., F. McSherry, K. Nissim, and A. Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Third Theory of cryptography conference, ed. S. Halevi and T. Rabin. TCC 2013. Lecture Notes in Computer Science, vol. 7785. 265–84. Berlin, Heidelberg: Springer.
- Frank, O., and D. Strauss. 1986. Markov graphs. Journal of the American Statistical Association 81 (395):832–42. doi:https://doi.org/10.1080/01621459.1986.10478342.
- Freeman, S., and L. Freeman. 1979. The networkers network: A study of the impact of a new communications medium on sociometric structure. Social Sciences Research Reports No. 46. Irvine, CA: University of California.
- Han, J. D. J., D. Dupuy, N. Bertin, M. E. Cusick, and M. Vidal. 2005. Effect of sampling on topology predictions of protein-protein interaction networks. Nature Biotechnology 23 (7):839–44. doi:https://doi.org/10.1038/nbt1116.
- Hay, M., C. Li, G. Miklau, and D. Jensen. 2009. Accurate estimation of the degree distribution of private networks. Proceedings of the 9th IEEE International Conference on Data Mining, ICDM'09, Miami, FL, USA. 169–78. IEEE.
- Hay, M., and G. Miklau, and D. Jensen. 2010. Analyzing private network data. In Privacy-aware knowledge discovery: Novel applications and new techniques, 459–98. Boca Raton, FL: CRC Press.
- Holland, P. W., and S. Leinhardt. 1981. An exponential family of probability distributions for directed graphs. Journal of the American Statistical Association 76 (373):33–50. doi:https://doi.org/10.1080/01621459.1981.10477598.
- Karwa, V., and A. Slavković. 2016. Inference using noisy degrees: Differentially private β-model and synthetic graphs. The Annals of Statistics 44 (1):87–112. doi:https://doi.org/10.1214/15-AOS1358.
- Kasiviswanathan, S. P., K. Nissim, S. Raskhodnikova, and A. Smith. 2013. Analyzing graphs with node differential privacy. In Theory of Cryptography, ed. A. Sahai. TCC 2013. Lecture Notes in Computer Science, vol. 7785, 457–76. Berlin, Heidelberg: Springer.
- Lu, W., and G. Miklau. 2014. Exponential random graph estimation under differential privacy. Paper presented at the Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, 921–30. ACM. doi:https://doi.org/10.1145/2623330.2623683.
- Newman, M. E. 2001. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of Sciences 98 (2):404–9. doi:https://doi.org/10.1073/pnas.98.2.404.
- Nissim, K., S. Raskhodnikova, and A. Smith. 2007. Smooth sensitivity and sampling in private data analysis. Symposium Theory of Computing (STOC), 75–84. doi:https://doi.org/10.1145/1250790.1250803.
- Pan, L., and T. Yan. 2019. Asymptotics in the β-model for networks with a differentially private degree sequence. Communications in Statistics - Theory and Methods 133:1–16. doi:https://doi.org/10.1080/03610926.2019.1599023.
- Task, C., and C. Clifton. 2012. A guide to differential privacy theory in social network analysis. Paper presented at the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 411–17. Istanbul: IEEE.
- Vershynin, R. 2010. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027.
- Wang, Y. J., and G. Y. Wong. 1987. Stochastic blockmodels for directed graphs. Journal of the American Statistical Association 82 (397):8–19. doi:https://doi.org/10.1080/01621459.1987.10478385.
- Wasserman, S., and P. Pattison. 1996. Logit models and logistic regressions for social networks: I. An introduction to markov graphs andp. Psychometrika 61 (3):401–25. doi:https://doi.org/10.1007/BF02294547.
- Yan, T. 2020. Directed networks with a differentially private bi-degree sequence. Statistica Sinica. doi:https://doi.org/10.5705/ss.202019.0215.
- Yan, T., C. Leng, and J. Zhu. 2016. Asymptotics in directed exponential random graph models with an increasing bi-degree sequence. The Annals of Statistics 44 (1):31–57. doi:https://doi.org/10.1214/15-AOS1343.
- Yan, T., and J. Xu. 2013. A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices. Biometrika 100 (2):519–24. doi:https://doi.org/10.1093/biomet/ass084.
- Zhang, Y., S. Chen, Q. Hong, and T. Yan. 2016. Directed weighted random graphs with an increasing bi-degree sequence. Statistics Probability Letters 119:235–40. doi:https://doi.org/10.1016/j.spl.2016.08.007.