Model selection and hypothesis testing for large-scale network models with overlapping groups

Physical Review X

Volumn 5, Issue 1, 2015, Pages

  Peixoto, Tiago P ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Complex systems; Interdisciplinary physics; Statistical physics

Indexed keywords

DEGREES OF FREEDOM (MECHANICS); LARGE SCALE SYSTEMS; STATISTICAL TESTS;

INTERDISCIPLINARY PHYSICS; LARGE SCALE STRUCTURES; LARGE-SCALE NETWORK; MINIMUM DESCRIPTION LENGTH CRITERIA; PROBABILISTIC FRAMEWORK; STATISTICAL EVIDENCE; STATISTICAL INFERENCE; STATISTICAL PHYSICS;

COMPLEX NETWORKS;

EID: 84961288934     PISSN: None     EISSN: 21603308     Source Type: Journal    
DOI: 10.1103/PhysRevX.5.011033     Document Type: Article

References (91)

1. M. E. J. Newman, Communities, Modules and Large-Scale Structure in Networks, Nat. Phys. 8, 25 (2011).
2. S. Fortunato, Community Detection in Graphs, Phys. Rep. 486, 75 (2010).
3. P. Holme, Core-Periphery Organization of Complex Networks, Phys. Rev. E 72, 046111 (2005).
4. M. P. Rombach, M. A. Porter, J. H. Fowler, and P. J. Mucha, Core-Periphery Structure in Networks, arXiv:1202.2684.
5. D. B. Larremore, A. Clauset, and A. Z. Jacobs, Efficiently Inferring Community Structure in Bipartite Networks, Phys. Rev. E 90, 012805 (2014).
6. A. Clauset, C. Moore, and M. E. J. Newman, Hierarchical Structure and the Prediction of Missing Links in Networks, Nature (London) 453, 98 (2008).
7. T. P. Peixoto, Hierarchical Block Structures and High-Resolution Model Selection in Large Networks, Phys. Rev. X 4, 011047 (2014).
8. R. Guimerá and M. Sales-Pardo, Missing and Spurious Interactions and the Reconstruction of Complex Networks, Proc. Natl. Acad. Sci. U.S.A. 106, 22073 (2009).
9. S. V. Buldyrev, R. Parshani, G. Paul, H. E. Stanley, and S. Havlin, Catastrophic Cascade of Failures in Interdependent Networks, Nature (London) 464, 1025 (2010).
10. A. Apolloni, C. Poletto, J. J. Ramasco, P. Jensen, and V. Colizza, Metapopulation Epidemic Models with Heterogeneous Mixing and Travel Behaviour, Theor. Biol. Med. Model. 11, 3 (2014).
11. R. Guimerá and L. A. N. Amaral, Functional Cartography of Complex Metabolic Networks, Nature (London) 433, 895 (2005).
12. M. E. J. Newman, Modularity and Community Structure in Networks, Proc. Natl. Acad. Sci. U.S.A. 103, 8577 (2006).
13. M. Girvan and M. E. J. Newman, Community Structure in Social and Biological Networks, Proc. Natl. Acad. Sci. U.S.A. 99, 7821 (2002).
14. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann, Link Communities Reveal Multiscale Complexity in Networks, Nature (London) 466, 761 (2010).
15. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society, Nature (London) 435, 814 (2005).
16. M. Rosvall and C. T. Bergstrom, Maps of Random Walks on Complex Networks Reveal Community Structure, Proc. Natl. Acad. Sci. U.S.A. 105, 1118 (2008).
17. P.W. Holland, K. B. Laskey, and S. Leinhardt, Stochastic Blockmodels: First Steps, Soc. Networks 5, 109 (1983).
18. E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing, Mixed Membership Stochastic Blockmodels, J. Mach. Learn. Res. 9, 1981 (2008).
19. B. Karrer and M. E. J. Newman, Stochastic Blockmodels and Community Structure in Networks, Phys. Rev. E 83, 016107 (2011).
20. B. Ball, B. Karrer, and M. E. J. Newman, Efficient and Principled Method for Detecting Communities in Networks, Phys. Rev. E 84, 036103 (2011).
21. A. Lancichinetti, S. Fortunato, and J. Kertész, Detecting the Overlapping and Hierarchical Community Structure in Complex Networks, New J. Phys. 11, 033015 (2009).
22. G. Palla, L. Lovász, and T. Vicsek, Multifractal Network Generator, Proc. Natl. Acad. Sci. U.S.A. 107, 7640 (2010).
23. J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani, Kronecker Graphs: An Approach to Modeling Networks, J. Mach. Learn. Res. 11, 985 (2010).
24. M. Mariadassou, S. Robin, and C. Vacher, Uncovering Latent Structure in Valued Graphs: A Variational Approach, Ann. Appl. Stat. 4, 715 (2010).
25. C. Aicher, A. Z. Jacobs, and A. Clauset, Learning Latent Block Structure in Weighted Networks, J. Complex Networks (2014).
26. B. Ball and M. E. J. Newman, Friendship Networks and Social Status, Netw. Sci. 1, 16 (2013).
27. M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter, Multilayer Networks, J. Complex Networks 2, 203 (2014).
28. W. Fu, L. Song, and E. P. Xing, Dynamic Mixed Membership Blockmodel for Evolving Networks, in Proceedings of the 26th Annual International Conference on Machine Learning (ACM, New York, NY, 2009), pp. 329-336.
29. X. Yan, C. Shalizi, J. E. Jensen, F. Krzakala, C. Moore, L. Zdeborová, P. Zhang, and Y. Zhu, Model Selection for Degree-Corrected Block Models, J. Stat. Mech. (2014) P05007.
30. M. E. J. Newman, Community Detection and Graph Partitioning, Europhys. Lett. 103, 28003 (2013).
31. M. E. J. Newman, Spectral Methods for Community Detection and Graph Partitioning, Phys. Rev. E 88, 042822 (2013).
32. R. R. Nadakuditi and M. E. J. Newman, Graph Spectra and the Detectability of Community Structure in Networks, Phys. Rev. Lett. 108, 188701 (2012).
33. F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang, Spectral Redemption in Clustering Sparse Networks, Proc. Natl. Acad. Sci. U.S.A. 110, 20935 (2013).
34. A. Lancichinetti, S. Fortunato, and F. Radicchi, Benchmark Graphs for Testing Community Detection Algorithms, Phys. Rev. E 78, 046110 (2008).
35. A. Lancichinetti and S. Fortunato, Benchmarks for Testing Community Detection Algorithms on Directed and Weighted Graphs with Overlapping Communities, Phys. Rev. E 80, 016118 (2009).
36. A. Lancichinetti and S. Fortunato, Community Detection Algorithms: A Comparative Analysis, Phys. Rev. E 80, 056117 (2009).
37. B. Karrer, E. Levina, and M. E. J Newman, Robustness of Community Structure in Networks, Phys. Rev. E 77, 046119 (2008).
38. P. D. Grünwald, The Minimum Description Length Principle (MIT Press, Cambridge, 2007).
39. J. Rissanen, Information and Complexity in Statistical Modeling, 1st ed. (Springer, New York, 2010).
40. M. Rosvall, A. V. Esquivel, A. Lancichinetti, J. D.West, and R. Lambiotte, Memory in Network Flows and Its Effects on Spreading Dynamics and Community Detection, Nat. Commun. 5, 4630 (2014).
41. G. Bianconi, Entropy of Network Ensembles, Phys. Rev. E 79, 036114 (2009).
42. T. P. Peixoto, Entropy of Stochastic Blockmodel Ensembles, Phys. Rev. E 85, 056122 (2012).
43. M. Rosvall and C. T. Bergstrom, An Information-Theoretic Framework for Resolving Community Structure in Complex Networks, Proc. Natl. Acad. Sci. U.S.A. 104, 7327 (2007).
44. S. E. Fienberg, M. M. Meyer, and S. S. Wasserman, Statistical Analysis of Multiple Sociometric Relations, J. Am. Stat. Assoc. 80, 51 (1985).
45. K. Faust and S. Wasserman, Blockmodels: Interpretation and Evaluation, Soc. Networks 14, 5 (1992).
46. C. J. Anderson, S. Wasserman, and K. Faust, Building Stochastic Blockmodels, Soc. Networks 14, 137 (1992).
47. P. Latouche, E. Birmelé, and C. Ambroise, Model Selection in Overlapping Stochastic Block Models, Electronic J. Stat. 8, 762 (2014).
48. T. P. Peixoto, Parsimonious Module Inference in Large Networks, Phys. Rev. Lett. 110, 148701 (2013).
49. E. T. Jaynes, Probability Theory: The Logic of Science, edited by G. L. Bretthorst (Cambridge University Press, Cambridge, England New York, NY, 2003).
50. Sir H. Jeffreys, The Theory of Probability (Oxford University Press, Oxford, 1998).
51. D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, 1st ed. (Addison-Wesley Professional, New York, N.Y.; Reading, MA, 1993).
52. T. S. Evans, American College Football Network Files, FigShare (2012), 10.6084/m9.figshare.93179.
53. L. A. Adamic and N. Glance, The Political Blogosphere and the 2004 U.S. Election: Divided They Blog, in Proceedings of the 3rd International Workshop on Link Discovery (ACM, New York, NY, 2005), pp. 36-43.
54. D. Holten, Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data, IEEE Trans. Visual. Comput. Graph. 12, 741 (2006).
55. J. Mcauley and J. Leskovec, Discovering Social Circles in Ego Networks, ACM Trans. Knowl. Discov. Data 8, 4:1 (2014).
56. E. Cho, S. A. Myers, and J. Leskovec, Friendship and Mobility: User Movement in Location-Based Social Networks, in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York, NY, 2011), pp. 1082-1090.
57. D. J. Watts and S. H. Strogatz, Collective Dynamics of "Small-World" Networks, Nature (London) 393, 440 (1998).
58. J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph Evolution: Densification and Shrinking Diameters, ACM Trans. Knowl. Discov. Data 1, 2 (2007).
59. M. E. J. Newman, Finding Community Structure in Networks Using the Eigenvectors of Matrices, Phys. Rev. E 74, 036104 (2006).
60. K. I. Goh, M. E. Cusick, D. Valle, B. Childs, M. Vidal, and A. L. Barabási, The Human Disease Network, Proc. Natl. Acad. Sci. U.S.A. 104, 8685 (2007).
61. W.W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of anthropological research 33, 452 (1977).
62. J. Leskovec, K. J. Lang, A. Dasgupta, and M.W. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, arXiv:0810.1355.
63. B. Klimt and Y. Yang, Introducing the Enron Corpus, in Conference on Email and Anti-Spam, Mountain View, CA, USA (2004).
64. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations, Behav. Ecol. Sociobiol. 54, 396 (2003).
65. O. Richters and T. P. Peixoto, Trust Transitivity in Social Networks, PLoS One 6, e18384 (2011).
66. M. Richardson, R. Agrawal, and P. Domingos, Trust Management for the Semantic Web, in The Semantic Web-ISWC 2003, Lecture Notes in Computer Science No. 2870, edited by D. Fensel, K. Sycara, and J. Mylopoulos (Springer, Berlin-Heidelberg, 2003), pp. 351-368.
67. H. Yu et al., High-Quality Binary Protein Interaction Map of the Yeast Interactome Network, Science 322, 104 (2008).
68. T. Reguly, A. Breitkreutz, L. Boucher, B.-J. Breitkreutz, G. C. Hon, C. L. Myers, A. Parsons, H. Friesen, R. Oughtred, A. Tong, C. Stark, Y. Ho, D. Botstein, B. Andrews, C. Boone, O. G. Troyanskya, T. Ideker, K. Dolinski, N. N. Batada, and M. Tyers, Comprehensive Curation and Analysis of Global Interaction Networks in Saccharomyces Cerevisiae, J. Biol. 5, 11 (2006).
69. S. R. Collins, P. Kemmeren, X.-C. Zhao, J. F. Greenblatt, F. Spencer, F. C. P. Holstege, J. S. Weissman, and N. J. Krogan, Toward a Comprehensive Atlas of the Physical Interactome of Saccharomyces Cerevisiae, Mol. Cell. Proteomics 6, 439 (2007).
70. H. Salgado et al., RegulonDB v8.0: Omics Data Sets, Evolutionary Conservation, Regulatory Phrases, Cross- Validated Gold Standards and More, Nucleic Acids Res. 41, D203 (2013).
71. J. McAuley and J. Leskovec, Image Labeling on a Network: Using Social-Network Metadata for Image Classification, in Computer Vision-ECCV 2012, Lecture Notes in Computer Science No. 7575, edited by A. Fitzgibbon, S. Lazebnik, P. Perona, Y. Sato, and C. Schmid (Springer, Berlin-Heidelberg, 2012), pp. 828-841.
72. J. Leskovec, K. J. Lang, A. Dasgupta, and M.W. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, Internet Math. 6, 29 (2009).
73. J. Yang and J. Leskovec, Defining and Evaluating Network Communities Based on Ground-Truth, in Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics (ACM, New York, NY, 2012), pp. 3:1-3:8.
74. R. Albert, H. Jeong, and A.-L. Barabási, Internet: Diameter of the World-Wide Web, Nature (London) 401, 130 (1999).
75. J. Leskovec, D. Huttenlocher, and J. Kleinberg, Signed Networks in Social Media, in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (ACM, New York, NY, 2010), pp. 1361-1370.
76. J. Leskovec, D. Huttenlocher, and J. Kleinberg, Predicting Positive and Negative Links in Online Social Networks, in Proceedings of the 19th International Conference on World Wide Web (ACM, New York, NY, 2010), pp. 641-650.
77. T. S. Keshava Prasad et al., Human Protein Reference Database-2009 Update, Nucleic Acids Res. 37, D767 (2009).
78. M. E. J. Newman, Fast Algorithm for Detecting Community Structure in Networks, Phys. Rev. E 69, 066133 (2004).
79. A. Clauset, M. E. J. Newman, and C. Moore, Finding Community Structure in Very Large Networks, Phys. Rev. E 70, 066111 (2004).
80. A. Arenas, L. Danon, A. Díaz-Guilera, P. M. Gleiser, and R. Guimerá, Community Analysis in Social Networks, Eur. Phys. J. B 38, 373 (2004).
81. T. P. Peixoto, Efficient Monte Carlo and Greedy Heuristic for the Inference of Stochastic Block Models, Phys. Rev. E 89, 012804 (2014).
82. N. Metropolis, A.W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of State Calculations by Fast Computing Machines, J. Chem. Phys. 21, 1087 (1953).
83. W. K. Hastings, Monte Carlo Sampling Methods Using Markov Chains and Their Applications, Biometrika 57, 97 (1970).
84. A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Inference and Phase Transitions in the Detection of Modules in Sparse Networks, Phys. Rev. Lett. 107, 065701 (2011).
85. A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic Analysis of the Stochastic Block Model for Modular Networks and Its Algorithmic Applications, Phys. Rev. E 84, 066106 (2011).
86. P. K. Gopalan and D. M. Blei, Efficient Discovery of Overlapping Communities in Massive Networks, Proc. Natl. Acad. Sci. U.S.A. 110, 14534 (2013).
87. T. P. Peixoto, The Graph-Tool Python Library, Figshare, doi: 10.6084/m9.figshare.1164194 (2014).
88. A. V. Esquivel and M. Rosvall, Compression of Flow Can Reveal Overlapping-Module Organization in Networks, Phys. Rev. X 1, 021025 (2011).
89. P. D. Hoff, A. E. Raftery, and M. S. Handcock, Latent Space Approaches to Social Network Analysis, J. Am. Stat. Assoc. 97, 1090 (2002).
90. J. Parkkinen, J. Sinkkonen, A. Gyenge, and S. Kaski, A Block Model Suitable for Sparse Graphs, in Proceedings of the 7th International Workshop on Mining and Learning with Graphs (MLG 2009), Leuven (2009).
91. J. Yang and J. Leskovec, Community-Affiliation Graph Model for Overlapping Network Community Detection, in Proceedings of the 2012 IEEE 12th International Conference on Data Mining (ICDM), (IEEE, Brussels, 2012) pp. 1170-1175.