The method of moments and degree distributions for network models

Annals of Statistics

Volumn 39, Issue 5, 2011, Pages 2280-2301

  Bickel, Peter J ^a   Chen, Aiyou ^b   Levina, Elizaveta ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b GOOGLE INC   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Block model; Community detection; Social networks

Indexed keywords

EID: 82655189991     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/11-AOS904     Document Type: Article

References (31)

1. ALDOUS, D. J. (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 581-598. MR0637937
2. BARABÁSI, A.-L. and ALBERT, R. (1999). Emergence of scaling in random networks. Science 286 509-512. MR2091634
3. BICKEL, P. J. andCHEN, A. (2009). A nonparametric view of network models and Newman-Girvan and other modularities. Proc. Natl. Acad. Sci. USA 106 21068-21073.
4. BOLLOBÁS, B., JANSON, S. and RIORDAN, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3-122. MR2337396
5. CHARTRAND, G., LESNIAK, L. and BEHZAD, M. (1986). Graphs and Digraphs, 2nd ed. Wadsworth and Brooks, Monterey, CA.
6. CHATTERJEE, S. and DIACONIS, P. (2011). Estimating and understanding exponential random graph models. Unpublished manuscript. Available at arXiv:1102.2650.
7. CHUNG, F. and LU, L. (2002). Connected components in random graphs with given expected degree sequences. Ann. Comb. 6 125-145. MR1955514
8. DE SOLLA PRICE, D. J. (1965). Networks of scientific papers. Science 149 510-515.
9. DECELLE, A., KRZAKALA, F., MOORE, C. and ZDEBOROVÁ, L. (2011). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Available at arXiv:1109.3041.
10. DIACONIS, P. and JANSON, S. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7) 28 33-61. MR2463439
11. DOUKHAN, P. (1994). Mixing: Properties and Examples. Lecture Notes in Statistics 85. Springer, New York. MR1312160
12. FELLER, W. (1971). An Introduction to Probability Theory and Its Applications. Vol. II, 2nd ed. Wiley, New York. MR0270403
13. FRANK, O. and STRAUSS, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81 832-842. MR0860518
14. HANDCOCK, M. (2003). Assessing degeneracy in statistical models of social networks. Working Paper 39, Center for Statistics and the Social Sciences.
15. HANDCOCK, M. S., RAFTERY, A. E. and TANTRUM, J. M. (2007). Model-based clustering for social networks. J. Roy. Statist. Soc. Ser. A 170 301-354. MR2364300
16. HOFF, P. D. (2007). Modeling homophily and stochastic equivalence in symmetric relational data. In Advances in Neural Information Processing Systems 19. MIT Press, Cambridge, MA.
17. HOFF, P. D., RAFTERY, A. E. and HANDCOCK, M. S. (2002). Latent space approaches to social network analysis. J. Amer. Statist. Assoc. 97 1090-1098. MR1951262 (Pubitemid 36136568)
18. HOLLAND, P.W., LASKEY, K. B. and LEINHARDT, S. (1983). Stochastic blockmodels: First steps. Social Networks 5 109-137. MR0718088
19. HOLLAND, P.W. and LEINHARDT, S. (1981). An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76 33-65. MR0608176
20. HOOVER, D. (1979). Relations on probability spaces and arrays of random variables. Technical report, Institute for Advanced Study, Princeton, NJ.
21. KALLENBERG, O. (2005). Probabilistic Symmetries and Invariance Principles. Springer, New York. MR2161313
22. KARRER, B. and NEWMAN, M. E. J. (2011). Stochastic blockmodels and community structure in networks. Phys. Rev. E (3) 83 016107. MR2788206
23. NEWMAN, M. E. J. (2006). Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E (3) 74 036104. MR2282139
24. NEWMAN, M. E. J. (2010). Networks: An Introduction. Oxford Univ. Press, Oxford. MR2676073
25. NOWICKI, K. and SNIJDERS, T. A. B. (2001). Estimation and prediction for stochastic blockstructures. J. Amer. Statist. Assoc. 96 1077-1087. MR1947255
26. PICARD, F., DAUDIN, J. J., KOSKAS, M., SCHBATH, S. and ROBIN, S. (2008). Assessing the exceptionality of network motifs. J. Comput. Biol. 15 1-20. MR2383618 (Pubitemid 351271544)
27. ROBINS, G., SNIJDERS, T., WANG, P., HANDCOCK, M. and PATTISON, P. (2007). Recent developments in exponential random graphs models (p*) for social networks. Social Networks 29 192-215.
28. ROHE, K., CHATTERJEE, S. and YU, B. (2011). Spectral clustering and the high-dimensional stochastic block model. Ann. Statist. To appear.
29. SERFLING, R. J. (1980). Approximation Theorems of Mathematical Statistics. Wiley, New York. MR0595165
30. SHALIZI, C. R. and RINALDO, A. (2011). Projective structure and parametric inference in exponential families. Carnegie Mellon Univ. Unpublished manuscript.
31. SNIJDERS, T. A. B. and NOWICKI, K. (1997). Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J. Classification 14 75-100. MR1449742