A nonparametric view of network models and Newman-Girvan and other modularities

Proceedings of the National Academy of Sciences of the United States of America

Volumn 106, Issue 50, 2009, Pages 21068-21073

  Bickel, Peter J ^a   Chen, Aiyou ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Ergodic model; Modularity; Profile likelihood; Spectral clustering

Indexed keywords

ANALYTIC METHOD; ARTICLE; COMMUNITY; PHYSICS; PRIORITY JOURNAL; SIMULATION; SOCIOLOGY; THEORY;

COMMUNITY NETWORKS; COMPUTER SIMULATION; HUMANS; SYSTEMS THEORY;

EID: 75849140057     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.0907096106     Document Type: Article

References (21)

1. Doreian P, Batagelj V, Ferligoj A (2005) Generalized Blockmodeling (Cambridge Univ Press, Cambridge, UK).
2. Airoldi EM, Blei DM, Fienberg SE, Xing XP (2008) Mixed-membership stochastic blockmodels. J Machine Learning Res 9:1981-2014.
3. Erdös P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hungar Acad Sci 5:17-61.
4. Bollobas B, Janson S, Riordan O (2007) The phase transition in inhomogeneous random graphs. Random Struct Algorithms 31:3-122.
5. Zhao Y, et al. (2009) Botgraph: Large scale spamming botnet detection. Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (USENIX, Berkeley, CA), pp 321-334.
6. Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113.
7. Guimera R, Amaral LAN (2005) Functional cartography of complex metabolic networks. Nature 433:895-900.
8. Chung FRK, Lu L (2006) Complex Graphs and Networks. CBMS Regional Conference Series in Mathematics (Am Math Soc, Providence, RI).
9. Kallenberg O (2005) Probabilistic symmetries and invariance principles. Probability and Its Application (Springer, New York).
10. Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: First steps. Soc Networks 5:109-137.
11. Snijders T, Nowicki K. (1997) Estimation and prediction for stochastic block-structures for graphs with latent block structure. J Classification 14:75-100.
12. Hoff PD (2008) Modeling homophily and stochastic equivalence in symmetric relational data. Advances in Neural Information Processing Systems, eds Platt J, Koller D, Roweis S (MIT Press, Cambridge, MA) Vol 20, pp 657-664.
13. Diaconis P, Janson S (2008) Graph limits and exchangeable random graphs. Rendiconti di Matematica 28:33-61.
14. Hardy G, Littlewood J, Polya G (1988) Inequalities. (Cambridge Univ Press, Cambridge, UK), 2nd Ed.
15. Newman MEJ, Leicht EA (2007) Mixture models and exploratory analysis in networks. Proc Natl Acad Sci USA 104:9564-9569.
16. Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104.
17. Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci USA 104:36-41.
18. Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems (MIT Press, Cambridge, MA) Vol 14, pp 849-856.
19. Stephens M (2000) Dealing with label-switching in mixture models. J R Stat Soc B 62:795-809.
20. Zachary W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452-473.
21. Rosvall M, Bergstrom C (2007) An information-theoretic framework for resolving community structure in complex network. Proc Natl Acad Sci USA 104:7327-7331.