Reconstruction in the labeled stochastic block model

2013 IEEE Information Theory Workshop, ITW 2013

Volumn , Issue , 2013, Pages

  Lelarge, Marc ^a   Massoulie, Laurent ^b   Xu, Jiaming ^c  

^a INRIA ENS ^*  (United States)

^b Parc Orsay Université   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNITY OR; COMMUNITY STRUCTURES; EQUAL SIZES; MODEL PARAMETERS; RANDOM GRAPH MODELS; SPECTRAL METHODS; STOCHASTIC BLOCK MODELS; WEIGHTED GRAPH;

GRAPH THEORY; INFORMATION THEORY; STOCHASTIC SYSTEMS;

STOCHASTIC MODELS;

EID: 84893256766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2013.6691264     Document Type: Conference Paper

References (20)

1. S. Heimlicher, M. Lelarge, and L. Massoulié, "Community detection in the labelled stochastic block model, " Nov. 2012, available at: http://arxiv.org/abs/1209.2910.
2. S. Fortunato, "Community detection in graphs, " Jan. 2010, available at: http://arxiv.org/abs/0906.0612.
3. K. Rohe, S. Chatterjee, and B. Yu, "Spectral clustering and the highdimensional stochastic blockmodel, " The Annals of Statistics, vol. 39, no. 4, pp. 1878-1915, 2011.
4. A. Decelle, F. Krzakala, C. Moore, and L. Zdeborova, "Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, " Physics Review E, vol. 84:066106, 2011.
5. M. Lelarge, L. Massoulié, and J. Xu, "Reconstruction in the labelled stochastic block model, " May. 2013, Preprint.
6. M. Dyer and A. Frieze, "The solution of some random NP-hard problems in polynomial expected time, " Journal of Algorithms, vol. 10, no. 4, pp. 451 - 489, 1989.
7. M. Jerrum and G. B. Sorkin, "The metropolis algorithm for graph bisection, " Discrete Applied Mathematics, vol. 82, no. 1-3, pp. 155 - 175, 1998. (Pubitemid 128388481)
8. A. Condon and R. M. Karp, "Algorithms for graph partitioning on the planted partition model, " Random Struct. Algorithms, vol. 18, no. 2, pp. 116-140, Mar 2001.
9. F. McSherry, "Spectral partitioning of random graphs, " in 42nd IEEE Symposium on Foundations of Computer Science, Oct. 2001, pp. 529 - 537. (Pubitemid 33068414)
10. L. Massoulié and D.-C. Tomozei, "Distributed user profiling via spectral methods, " Sep. 2011, available at: http://arxiv.org/abs/1109. 3318.
11. Y. Chen, S. Sanghavi, and H. Xu, "Clustering sparse graphs, " Oct. 2012, available at: http://arxiv.org/abs/1210.3335.
12. E. Mossel, J. Neeman, and A. Sly, "Stochastic block models and reconstruction, " Feb. 2012, available at: http://arxiv.org/abs/1202.1499.
13. A. Coja-oghlan, "Graph partitioning via adaptive spectral techniques, " Comb. Probab. Comput., vol. 19, no. 2, 2010.
14. M. R. Garey, D. S. Johnson, and L. Stockmeyer, "Some simplified NPcomplete graph problems, " Theoret. Comput. Sci., vol. 1, no. 3, pp. 237-267, 1976.
15. A. Coja-Oghlan, "A spectral heuristic for bisecting random graphs, " Random Structures Algorithms, vol. 29, no. 3, pp. 351-398, 2006. [Online]. Available: http://dx.doi.org/10.1002/rsa.20116. (Pubitemid 44497230)
16. M. E. J. Newman, "Modularity and community structure in networks, " Proceedings of the National Academy of Sciences, vol. 103, no. 23, pp. 8577-8582, 2006. (Pubitemid 43878062)
17. W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, "Broadcasting on trees and the ising model, " The Annals of Applied Probability, vol. 10, no. 2, pp. 410-433, 2000.
18. E. Mossel, "Survey - information flows on trees, " DIMACS series in discrete mathematics and theoretical computer science, pp. 155-170, 2004.
19. R. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries, " IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2980 -2998, June 2010.
20. V. H. Vu, "Spectral norm of random matrices, " Combinatorica, vol. 27, no. 6, pp. 721-736, 2007. [Online]. Available: http://dx.doi.org/10. 1007/s00493-007-2190-z.