Spectral redemption in clustering sparse networks

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

Volumn 110, Issue 52, 2013, Pages 20935-20940

  Krzakala, Florent ^a,b   Moore, Cristopher ^c   Mossel, Elchanan ^d   Neeman, Joe ^d   Sly, Allan ^d   Zdeborová, Lenka ^e   Zhang, Pan ^a,c  

^a PSL RESEARCH UNIVERSITY   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c SANTA FE INSTITUTE   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; SPECTRAL ALGORITHM; SPECTRUM; STOCHASTIC MODEL;

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

References (37)

1. Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: First steps. Soc Networks 5(2): 109-137.
2. Wang YJ, Wong GY (1987) Stochastic blockmodels for directed graphs. J Am Stat Assoc 82(397): 8-19.
3. Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4): 395-416.
4. Bickel PJ, Chen A (2009) A nonparametric view of network models and Newman- Girvan and other modularities. Proc Natl Acad Sci USA 106(50): 21068-21073.
5. Coja-Oghlan A, Mossel E, Vilenchik D (2009) A spectral approach to analyzing belief propagation for 3-coloring. Combin Probab Comput 18(6): 881-912.
6. Coja-Oghlan A (2010) Graph partitioning via adaptive spectral techniques. Combin Probab Comput 19(02): 227-284.
7. McSherry F (2001) Spectral partitioning of random graphs. Proceedings of 42nd Foundations of Computer Science (IEEE Computer Society, Las Vegas), pp 529-537.
8. Nadakuditi RR, Newman MEJ (2012) Graph spectra and the detectability of community structure in networks. Phys Rev Lett 108(18):188701.
9. Decelle A, Krzakala F, Moore C, Zdeborová L (2011) Inference and phase transitions in the detection of modules in sparse networks. Phys Rev Lett 107(6):065701.
10. Decelle A, Krzakala F, Moore C, Zdeborová L (2011) Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Phys Rev E Stat Nonlin Soft Matter Phys 84(6 Pt 2):066106.
11. Mossel E, Neeman J, Sly A (2012) Stochastic block models and reconstruction. arXiv: 1202.1499v4.
12. Zhang P, Krzakala F, Reichardt J, Zdeborová L (2012) Comparative study for inference of hidden classes in stochastic block models. J Stat Mech 12:P12021. Available at http://iopscience.iop.org/1742-5468/2012/12/P12021. Accessed November 14, 2013.
13. McKay BD (1981) The expected eigenvalue distribution of a large regular graph. Linear Algebra Appl 40: 203-216.
14. Sodin S (2007) Random matrices, nonbacktracking walks, and orthogonal polynomials. J Math Phys 48:123503.
15. Friedman J (2008) A proof of Alon's second eigenvalue conjecture and related problems. Memoirs of the American Mathematical Society 195(910).
16. Hashimoto K (1989) Zeta functions of finite graphs and representations of p-adic groups. Advanced Studies in Pure Mathematics 15: 211-280.
17. Alon N, Benjamini I, Lubetzky E, Sasha S (2007) Non-backtracking random walks mix faster. Commun Contemp Math 9(4): 585-603.
18. Watanabe Y, Fukumizu K (2010) Graph zeta function in the Bethe free energy and loopy belief propagation. arXiv:1002.3307.
19. Vontobel PO (2010) Connecting the Bethe entropy and the edge zeta function of a cycle code. Proceedings of the International Symposium on Information Theory (IEEE, New York), pp 704-708.
20. Ren P, Wilson RC, Hancock ER (2011) Graph characterization via Ihara coefficients. IEEE Trans Neural Netw 22(2): 233-245.
21. Wigner EP (1958) On the distribution of the roots of certain symmetric matrices. Ann Math 67(2): 325-327.
22. Krivelevich M, Sudakov B (2003) The largest eigenvalue of sparse random graphs. Combin Probab Comput 12(01): 61-72.
23. Bollobas B, Svante J, Oliver R (2007) The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31(1): 3-122.
24. Amini AA, Chen A, Bickel PJ, Levina E (2012) Pseudolikelihood methods for community detection in large sparse networks. arXiv:1207.2340.
25. Bass H (1992) The Ihara-Selberg zeta function of a tree lattice. Int J Math 3(06): 717-797.
26. Angel O, Friedman J, Hoory S (2007) The non-backtracking spectrum of the universal cover of a graph. arXiv:0712.0192.
27. Kesten H, Stigum BP (1966) Additional limit theorems for indecomposable multidimensional Galton-Watson processes. Ann Math Stat 37(6): 1463-1481.
28. Mossel E, Peres Y (2003) Information flow on trees. Ann Appl Probab 13: 817-844.
29. Richardson T, Urbanke R (2008) Modern Coding Theory (Cambridge Univ Press, Cambridge, UK).
30. Adamic L, Glance N (2005) The political blogosphere and the 2004 US Election: Divided they blog. Proceedings of the 3rd International Workshop on Link Discovery (Association for Computing Machinery, New York), pp 36-43.
31. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33: 452-473.
32. Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E Stat Nonlin Soft Matter Phys 74(3 Pt 2):036104.
33. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12): 7821-7826.
34. Lusseau D, et al. (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4): 396-405.
35. Krebs V (2012) Social Network Analysis software & services for organizations, communities, and their consultants. Available at www.orgnet.com/. Accessed November 14, 2013.
36. Ball B, Karrer B, Newman MEJ (2011) Efficient and principled method for detecting communities in networks. Phys Rev E Stat Nonlin Soft Matter Phys 84(3 Pt 2): 036103.
37. Gopalan P, Mimno D, Gerrish S, Freedman M, Blei D (2012) Scalable inference of overlapping communities. Advances in Neural Information Processing Systems 25, eds Bartlett P, Pereira FCN, Burges CJC, Bottou L, Weinberger KQ, pp 2258-2266.