References
- Albert, R., and A. Barabási. 2002. Statistical mechanics of complex networks. Reviews of Modern Physics 74 (1):47–97. doi:https://doi.org/10.1103/RevModPhys.74.47.
- Bickel, P. J., and A. Chen. 2009. A nonparametric view of network models and Newman-Girvan and other modularities. Proceedings of the National Academy of Sciences 106 (50):21068–73. doi:https://doi.org/10.1073/pnas.0907096106.
- Bickel, P. J., A. Chen, and E. Levina. 2011. The method of moments and degree distributions for network models. The Annals of Statistics 39 (5):2280–301. doi:https://doi.org/10.1214/11-AOS904.
- Blitzstein, J., and P. Diaconis. 2011. A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Mathematics 6 (4):489–522. doi:https://doi.org/10.1080/15427951.2010.557277.
- Britton, T., M. Deijfen, and A. Martin-Löf. 2006. Generating simple random graphs with prescribed degree distribution. Journal of Statistical Physics 124 (6):1377–97. doi:https://doi.org/10.1007/s10955-006-9168-x.
- Chatterjee, S., P. Diaconis, and A. Sly. 2011. Random graphs with a given degree sequence. The Annals of Applied Probability 21 (4):1400–35. pages doi:https://doi.org/10.1214/10-AAP728.
- Chung, F., and L. Lu. 2004. The average distance in a random graph with given expected degrees. Internet Mathematics 1 (1):91–113. doi:https://doi.org/10.1080/15427951.2004.10129081.
- Cutillo, L. A., R. Molva, and T. Strufe. 2010. Privacy preserving social networking through decentralization. Paper presented at International Conference on Wireless On-demand Network Systems and Services, Snowbird, UT, February 2–4.
- Dwork, C., Smith. M. F. N. K., and A. 2006. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography. TCC 2006. Lecture Notes in Computer Science, ed. S. Halevi, T. Rabin, vol 3876, 265–284. Berlin: Springer.
- Fan, Y., H. Zhang, and T. Yan. 2020. Asymptotic theory for differentially private generalized models with parameters increasing. arXiv Preprint arXiv:2002.12733 (Appear in Statistics and Its Interface).
- Fienberg, S. E. 2012. A brief history of statistical models for network analysis and open challenges. Journal of Computational and Graphical Statistics 21 (4):825–39. doi:https://doi.org/10.1080/10618600.2012.738106.
- Gautschi, W. 1959. Some elementary inequalities relating to the gamma and incomplete gamma function. Journal of Mathematics and Physics 38 (1–4):77–81. doi:https://doi.org/10.1002/sapm195938177.
- Gragg, W., and R. Tapia. 1974. Optimal error bounds for the Newton-Kantorovich theorem. SIAM Journal on Numerical Analysis 11 (1):10–3. doi:https://doi.org/10.1137/0711002.
- Hay, M., C. Li, G. Miklau, and D. Jensen. 2009. Accurate estimation of the degree distribution of private networks. In Ninth IEEE International Conference on Data Mining, 169–178. Miami, FL: IEEE.
- Hillar, C., and A. Wibisono. 2013. Maximum entropy distributions on graphs. http://arxiv.org/abs/1301.3321.
- Hoeffding, W. 1963. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (301):13–30. doi:https://doi.org/10.1080/01621459.1963.10500830.
- 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 beta-model and synthetic graphs. The Annals of Statistics 44 (1):87–112. doi:https://doi.org/10.1214/15-AOS1358.
- Lang, S. 1993. Real and functional analysis. New York: Springer-Verlag.
- Lu, W., and G. Miklau. 2014. Exponential random graph estimation under differential privacy. In Proceedings of the 20th ACM SIGKDD International Conference on Knowlege Discovery and Data Mining, New York, August 24–27.
- Luo, J., H. Qin, T. Yan, and L. Zeyneb. 2017. A note on asymptotic distributions in directed exponential random graph models with bi-degree sequences. Communications in Statistics - Theory and Methods 46 (18):8852–64. doi:https://doi.org/10.1080/03610926.2016.1193202.
- Narayanan, A., and V. Shmatikov. 2009. De-anonymizing social networks. In 30th IEEE Symposium on Security and Privacy, 173–187. New York: IEEE.
- Newman, M. E. 2001. Scientific collaboration networks. I. Network construction and fundamental results. Physical Review E 64 (1):016131. doi:https://doi.org/10.1103/PhysRevE.64.016131.
- Olhede, P., and P. J. Wolfe. 2012. Degree-based network models. arXiv:1211.6537.
- Pan, L., and T. Yan. 2019. Asymptotics in the beta-model for networks with a differentially private degree sequence. Communications in Statistics - Theory and Methods 1–16. doi:https://doi.org/10.1080/03610926.2019.1599023.
- Perry, P. O., and P. J. Wolfe. 2012. Null models for network data. arXiv:1201.5871.
- Rinaldo, A., S. Petrović, and S. E. Fienberg. 2013. Maximum lilkelihood estimation in the beta-model. The Annals of Statistics 41 (3):1085–110. doi:https://doi.org/10.1214/12-AOS1078.
- Vershynin, R. 2012. Introduction to the non-asymptotic analysis of random matrices. Chapter 5. In Compressed sensing, theory and applications, ed. Y. Eldar and G. Kutyniok. Cambridge, UK: Cambridge University Press.
- Wondracek, G., T. Holz, E. Kirda, and C. Kruegel. 2010. A practical attack to de-anonymize social network users. In 2010 IEEE Symposium on Security and Privacy, 1–15. Oakland: IEEE. doi:https://doi.org/10.1109/SP.2010.21.
- 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., H. Qin, and H. Wang. 2016. Asymptotics in undirected random graph models parameterized by the strengths of vertices. Statistica Sinica 26:273–93. doi:https://doi.org/10.5705/ss.2014.180.
- 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.
- Yan, T., Y. Zhao, and H. Qin. 2015. Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters. Journal of Multivariate Analysis 133:61–76. doi:https://doi.org/10.1016/j.jmva.2014.08.013.
- Yuan, M., C. Lei, and P. S. Yu. 2010. Personalized privacy protection in social networks. Proceedings of the VLDB Endowment 4 (2):141–50. doi:https://doi.org/10.14778/1921071.1921080.
- Zhang, H., and X. Wu. 2019. Compound Poisson point processes, concentration and oracle inequalities. Journal of Inequalities and Applications 2019 (1): 312. doi:https://doi.org/10.1186/s13660-019-2263-8.
- Zhao, Y., E. Levina, and J. Zhu. 2012. Consistency of community detection in networks under degree-corrected stochastic block models. The Annals of Statistics 40 (4):2266–92. doi:https://doi.org/10.1214/12-AOS1036.
- Zhou, B., J. Pei, and W. S. Luk. 2008. A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM SIGKDD Explorations Newsletter 10 (2):12–22. doi:https://doi.org/10.1145/1540276.1540279.