Community detection thresholds and the weak Ramanujan property

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2014, Pages 694-703

  Massoulié, Laurent ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Community detection; Phase transition; Spectral clustering; Spectral separation

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; PHASE TRANSITIONS; POPULATION DYNAMICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

ADJACENCY MATRICES; COMMUNITY DETECTION; CONSTRUCTED MATRICES; MODEL PARAMETERS; SHARP THRESHOLD; SPECTRAL CLUSTERING; SPECTRAL SEPARATION; STOCHASTIC BLOCK MODELS;

MATRIX ALGEBRA;

EID: 84904344028     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2591796.2591857     Document Type: Conference Paper

References (15)

1. A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, "Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications," Physics Review E, vol. 84:066106, 2011.
2. E. Mossel, J. Neeman, and A. Sly, "Reconstruction and estimation in the planted partition model," Feb. 2012, available at: http://arxiv.org/ abs/1202.1499.
3. P. W. Holland, K. B. Laskey, and S. Leinhardt, "Stochastic blockmodels: First steps," Social Networks, vol. 5, no. 2, pp. 109-137, 1983.
4. S. Heimlicher, M. Lelarge, and L. Massoulié, "Community detection in the labelled stochastic block model," NIPS Workshop on Algorithmic and Statistical Approaches for Large Social Networks, 2012.
5. W. Evans, C. Kenyon, Y. Peres, and L. Schulman, "Broadcasting on trees and the Ising model," The Annals of Applied Probability, vol. 10, no. 2, pp. 410-433, 2000.
6. A. Coja-Oghlan, "Graph partitioning via adaptive spectral techniques," Comb. Probab. Comput., vol. 19, no. 2, pp. 227-284, 2010. [Online]. Available: doi: 10.1017/S0963548309990514
7. J. Friedman, "A proof of Alon's second eigenvalue conjecture and related problem," Mem. Amer. Math. Soc., no. 910., 2008.
8. U. Feige and E. Ofek, "Spectral techniques applied to sparse random graphs," Random Struct. Algorithms, vol. 27, no. 2, pp. 251-275, Sept. 2005. [Online]. Available: doi: 10.1002/rsa.v27:2
9. F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang, "Spectral redemption: clustering sparse networks," Proceedings of the National Academy of Sciences, no. 110(52), pp. 20 935-20 940, 2013.
10. R. R. Nadakuditi and M. E. J. Newman, "Graph spectra and the detectability of community structure in networks," Phys. Rev. Lett., no. 108, 2012.
11. E. Mossel, J. Neeman, and A. Sly, "Belief propagation, robust reconstruction and optimal recovery of block models," Sep. 2013, available at: http://arxiv.org/abs/1309.1380.
12. - "A proof of the block model threshold conjecture," Nov. 2013, available at: http://arxiv.org/abs/1311.4115.
13. Z. Füredi and J. Komlós, "The eigenvalues of random symmetric matrices," Combinatorica, no. 1(3), pp. 233-241, 1981.
14. L. Massoulié, "Community detection thresholds and the weak Ramanujan property," Nov. 2013, available at: http://arxiv.org/abs/1311. 3085.
15. H. Kesten and B. P. Stigum, "Additional limit theorems for indecomposable multidimensional Galton-Watson processes," Ann. Math. Statist., no. 37, pp. 1463-1481, 1966.