References
- Adamic, L., and N. Glance. 2005. The political blogosphere and the 2004 U.S. election: Divided the blog. Paper presented at the Proceedings of the 3rd International Workshop on Link Discovery, Chicago, IL, USA, August 21–25, 36–43.
- Akoglu, L., P. O. S. Vaz de Melo, and C. Faloutsos. 2012. Quantifying reciprocity in large weighted communication networks. In Advances in knowledge discovery and data mining. PAKDD 2012. Lecture notes in computer science, ed. P. N. Tan, S. Chawla, C. K. Ho, and J. Bailey, Vol. 7302, 85–96. Berlin/Heidelberg, Germany: Springer.
- Bader, G., and C. Hogue. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4 (1):2–27. doi:https://doi.org/10.1186/1471-2105-4-2.
- 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.
- 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.
- Diesner, J., and K. Carley. 2005. Exploration of communication networks from the Enron email corpus. Paper presented at the Proceedings of Workshop on Link Analysis, Counterterrorism and Security, SIAM International Conference on Data Mining, Newport Beach, CA, April 21–23, 3–12.
- Emirbayer, M., and J. Goodwin. 1994. Network analysis, culture, and the problem of agency. American Journal of Sociology 99 (6):1411–54. doi:https://doi.org/10.1086/230450.
- Fienberg, S. 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.
- Goldenberg, A., A. X. Zheng, S. E. Fienberg, and E. Airoldi. 2010. A survey of statistical network models. Foundations and Trends® in Machine Learning 2 (2):129–233. doi:https://doi.org/10.1561/2200000005.
- Granovetter, M. 1985. Economic action and social structure: The problem of embeddedness. American Journal of Sociology 91 (3):481–510. doi:https://doi.org/10.1086/228311.
- Hillar, C., and A. Wibisono. 2013. Maximum entropy distributions on graphs. arXiv preprint arXiv: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 (with discussion). Journal of the American Statistical Association 76 (373):33–65. doi:https://doi.org/10.1080/01621459.1981.10477598.
- Lang, S. 1993. Real and functional analysis. New York, NY: Springer-Verlag.
- Loeve, M. 1977. Probability theory. I. 4th ed. New York, NY: Springer.
- Park, J., and M. E. J. Newman. 2004. Statistical mechanics of network. Physical Review E 70 (6):66–117. doi:https://doi.org/10.1103/PhysRevE.70.066117.
- Robins, G., P. Pattison, Y. Kalish, and D. Lusher. 2007. An introduction to exponential random graph (p*) models for social networks. Social Networks 29 (2):173–91. doi:https://doi.org/10.1016/j.socnet.2006.08.002.
- Snigders, T. A. B. 2003. Accounting for degree distributions in empirical analysis of network dynamics. In Dynamic social network modeling and analysis: Workshop summary and papers, ed. R. L. Breiger, K. M. Carley, and P. E. Pattison, 146–61. Washington, DC: The National Academies Press.
- Von Mering, C., R. Krause, B. Snel, M. Cornell, S. Oliver, S. Fields, and P. Bork. 2002. Comparative assessment of large-scale data sets of protein-protein interactions. Nature 417 (6887):399–403. doi:https://doi.org/10.1038/nature750.
- 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.