Comparative study for inference of hidden classes in stochastic block models

Journal of Statistical Mechanics: Theory and Experiment

Volumn 2012, Issue 12, 2012, Pages

  Zhang, Pan ^a   Krzakala, Florent ^a   Reichardt, Jörg ^b   Zdeborová, Lenka ^a  

^a CNRS   (France)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

analysis of algorithms; clustering techniques; message passing algorithms; statistical inference

Indexed keywords

EID: 84871885977     PISSN: None     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2012/12/P12021     Document Type: Article

References (26)

1. Daudin J J, Picard F and Robin S 2008 A mixture model for random graphs Stat. Comput. 18 173
2. Decelle A, Krzakala F, Moore C and Zdeborová L 2011 Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications Phys. Rev. E 84 066106
3. Decelle A, Krzakala F, Moore C and Zdeborová L 2011 Inference and phase transitions in the detection of modules in sparse networks Phys. Rev. Lett. 107 065701
4. Dempster A P, Laird N M and Rubin D B 1977 Maximum likelihood from incomplete data via the EM algorithm J. R. Stat. Soc. B 39 1
5. Easley D and Kleinberg J 2010 Networks, Crowds and Markets: Reasoning About a Highly Connected World (Cambridge: Cambridge University Press)
6. Goldenberg A, Zheng A X, Fienberg S E and Airoldi E M 2009 A survey of statistical network models Found. Trends Mach. Learn. 2 1
7. Hastings M B 2006 Community detection as an inference problem Phys. Rev. E 74 035102 (Pubitemid 44410812)
8. Hofman J M and Wiggins C H 2008 Bayesian approach to network modularity Phys. Rev. Lett. 100 258701
9. Holland P W, Laskey K B and Leinhard S 1983 Stochastic Block-models: first steps Soc. Netw. 5 109
10. Karlis D and Xekalaki E 2003 Choosing initial values for the EM algorithm for finite mixtures Comput. Stat. Data Anal. 41 577 (Pubitemid 36065397)
11. Lafon S and Lee A B 2006 Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parameterization IEEE Trans. Pattern Anal. Mach. Intell. 28 1393 (Pubitemid 44132647)
12. Mossel E, Neeman J and Sly A 2012 Stochastic block models and reconstruction arXiv:1202.1499v3
13. Nadakuditi R R and Newman M E J 2012 Graph spectra and the detectability of community structure in networks Phys. Rev. Lett. 108 188701
14. Neal R and Hinton G E 1998 A view of the EM algorithm that justifies incremental, sparse, and other variants Learning in Graphical Models (Dordrecht: Kluwer Academic) p 355
15. Newman M E J 2006 Finding community structure in networks using the eigenvectors of matrices Phys. Rev. E 74 036104 (Pubitemid 44521558)
16. Newman M E J and Girvan M 2004 Finding and evaluating community structure in networks Phys. Rev. E 69 026113
17. Newman M E J 2010 Complex Networks: An Introduction (Oxford: Oxford University Press)
18. Onsjö M and Watanabe W 2006 A Simple Message Passing Algorithm for Graph Partitioning Problems (Berlin: Springer) pp 507-516, number 4228 in LNCS
19. Pinkert S, Schultz J and Reichardt J 2010 Protein-interaction networks-more than mere modules PLoS Comput. Biol. 6 e1000659
20. Reichardt J and Leone M 2008 (Un)detectable cluster structure in sparse networks Phys. Rev. Lett. 101 078701
21. Reichardt J, Alamino R and Saad D 2011 The interplay between microscopic and mesoscopic structures in complex networks PLoS One 6 e21282
22. Sen P and Getoor L 2007 Link-based classification', Technical report University of Maryland Technical Reports CS-TR-4858
23. Uetz P et al 2000 A comprehensive analysis of protein-protein interactions in saccharomyces cerevisiae Nature 403 623 (Pubitemid 30103994)
24. Weiss Y 2001 Advanced Mean Field Methods: Theory and Practice (Cambridge, MA: MIT Press) chapter 15 p 229
25. Wellman B 2001 Computer Networks as Social Networks Science 293 2031 (Pubitemid 32848041)
26. Yedidia J S, Freeman W T and Weiss Y 2001 Understanding belief propagation and its generalizations IJCAI: Int. Joint Conf. on Artificial Intelligence