Erratum: Nonparametric Bayesian inference of the microcanonical stochastic block model (Physical Review E - Statistical, Nonlinear, and Soft Matter Physics (2017) 95 (012317) DOI: 10.1103/PhysRevE.95.012317);Nonparametric Bayesian inference of the microcanonical stochastic block model

Physical Review E

Volumn 95, Issue 1, 2017, Pages

  Peixoto, Tiago P ^a,b  

^a University of Bath   (United Kingdom)

^b ISI FOUNDATION   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; INFERENCE ENGINES; STOCHASTIC SYSTEMS;

HIERARCHICAL ORGANIZATIONS; INFERENCE ALGORITHM; MODULAR STRUCTURES; NON-INFORMATIVE PRIOR; NON-PARAMETRIC BAYESIAN INFERENCES; NONPARAMETRIC BAYESIAN METHODS; POSTERIOR DISTRIBUTIONS; STOCHASTIC BLOCK MODELS;

STOCHASTIC MODELS;

ARTICLE; STOCHASTIC MODEL;

EID: 85010424970     PISSN: 24700045     EISSN: 24700053     Source Type: Journal    
DOI: 10.1103/PhysRevE.95.019904     Document Type: Erratum

References (79)

1. S. Fortunato, Community detection in graphs, Phys. Rep. 486, 75 (2010). PRPLCM 0370-1573 10.1016/j.physrep.2009.11.002
2. S. Fortunato and D. Hric, Community detection in networks: A user guide, Phys. Rep. 659, 1 (2016). 10.1016/j.physrep.2016.09.002
3. R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral, Modularity from fluctuations in random graphs and complex networks, Phys. Rev. E 70, 025101 (R) (2004). PLEEE8 1539-3755 10.1103/PhysRevE.70.025101
4. S. Fortunato and M. Barthélemy, Resolution limit in community detection, Proc. Natl. Acad. Sci. USA 104, 36 (2007). PNASA6 0027-8424 10.1073/pnas.0605965104
5. B. H. Good, Y.-A. de Montjoye, and A. Clauset, Performance of modularity maximization in practical contexts, Phys. Rev. E 81, 046106 (2010). PLEEE8 1539-3755 10.1103/PhysRevE.81.046106
6. D. Hric, R. K. Darst, and S. Fortunato, Community detection in networks: Structural clusters versus ground truth, Phys. Rev. E 90, 062805 (2014). 10.1103/PhysRevE.90.062805
7. P. W. Holland, K. B. Laskey, and S. Leinhardt, Stochastic blockmodels: First steps, Social Networks 5, 109 (1983). 0378-8733 10.1016/0378-8733(83)90021-7
8. T. P. Peixoto, Parsimonious Module Inference in Large Networks, Phys. Rev. Lett. 110, 148701 (2013). PRLTAO 0031-9007 10.1103/PhysRevLett.110.148701
9. T. P. Peixoto, Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models, Phys. Rev. E 89, 012804 (2014). PLEEE8 1539-3755 10.1103/PhysRevE.89.012804
10. T. P. Peixoto, Hierarchical Block Structures and High-Resolution Model Selection in Large Networks, Phys. Rev. X 4, 011047 (2014). 2160-3308 10.1103/PhysRevX.4.011047
11. B. Karrer and M. E. J. Newman, Stochastic blockmodels and community structure in networks, Phys. Rev. E 83, 016107 (2011). PLEEE8 1539-3755 10.1103/PhysRevE.83.016107
12. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labeled regular graphs. Eur. J. Comb. 1, 311 (1980). EJOCDI 0195-6698 10.1016/S0195-6698(80)80030-8
13. B. K. Fosdick, D. B. Larremore, J. Nishimura, and J. Ugander, Configuring random graph models with fixed degree sequences, arXiv:1608.00607 [physics, q-bio, stat] (2016).
14. R. Guimerà and M. Sales-Pardo, Missing and spurious interactions and the reconstruction of complex networks, Proc. Natl. Acad. Sci. USA 106, 22073 (2009). PNASA6 0027-8424 10.1073/pnas.0908366106
15. X. Yan, Y. Zhu, J.-B. Rouquier, and C. Moore, Active learning for hidden attributes in networks, arXiv:1005.0794 (2010).
16. E. Côme and P. Latouche, Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood, Stat. Model. 15, 564 (2015). 1471-082X 10.1177/1471082X15577017
17. M. E. J. Newman and G. Reinert, Estimating the Number of Communities in a Network, Phys. Rev. Lett. 117, 078301 (2016). PRLTAO 0031-9007 10.1103/PhysRevLett.117.078301
18. J. Rissanen, Modeling by shortest data description, Automatica 14, 465 (1978). ATCAA9 0005-1098 10.1016/0005-1098(78)90005-5
19. P. D. Grünwald, The Minimum Description Length Principle (The MIT Press, Cambridge, MA, 2007).
20. P. Latouche, E. Birmelé, and C. Ambroise, Bayesian Methods for Graph Clustering, in Advances in Data Analysis, Data Handling and Business Intelligence, Studies in Classification, Data Analysis, and Knowledge Organization, edited by A. Fink, B. Lausen, W. Seidel, and A. Ultsch (Springer, Berlin/Heidelberg, 2009), pp. 229.
21. J. M. Hofman and C. H. Wiggins, Bayesian Approach to Network Modularity, Phys. Rev. Lett. 100, 258701 (2008). PRLTAO 0031-9007 10.1103/PhysRevLett.100.258701
22. X. Yan, Bayesian model selection of stochastic block models, arXiv:1605.07057 [cs, stat] (2016).
23. M. Rosvall and C. T. Bergstrom, An information-theoretic framework for resolving community structure in complex networks, Proc. Natl. Acad. Sci. USA 104, 7327 (2007). PNASA6 0027-8424 10.1073/pnas.0611034104
24. T. P. Peixoto, Model Selection and Hypothesis Testing for Large-Scale Network Models with Overlapping Groups, Phys. Rev. X 5, 011033 (2015). 2160-3308 10.1103/PhysRevX.5.011033
25. Note that this is not an issue when we are strictly maximizing the posterior, since the most likely partition will never contain empty groups.
26. A. Clauset, C. R. Shalizi, and M. E. J. Newman, Power-Law distributions in empirical data, SIAM Rev. 51, 661 (2009). SIREAD 0036-1445 10.1137/070710111
27. G. E. Andrews, The Theory of Partitions (Cambridge University Press, Cambridge, 1984).
28. G. Szekeres, An asymptotic formula in the theory of partitions, Q. J. Math. 2, 85 (1951). QJMAAT 0033-5606 10.1093/qmath/2.1.85
29. G. Szekeres, Some asymptotic formulae in the theory of partitions (ii), Q. J. Math. 4, 96 (1953). QJMAAT 0033-5606 10.1093/qmath/4.1.96
30. E. R. Canfield, From recursions to asymptotics: On Szekeres' formula for the number of partitions, Electronic J. Combinator. 4, R6 (1996).
31. P. Erdos and J. Lehner, The distribution of the number of summands in the partitions of a positive integer, Duke Math. J. 8, 335 (1941). DUMJAO 0012-7094 10.1215/S0012-7094-41-00826-8
32. G. H. Hardy and S. Ramanujan, Une formule asymptotique pour le nombres des partitions de n, C. R. Acad. Sci. Paris Ser. A 2 (1917).
33. G. H. Hardy and S. Ramanujan, Asymptotic formulaae in combinatory analysis, Proc. London Math. Soc. s2-17, 75 (1918). PLMTAL 0024-6115 10.1112/plms/s2-17.1.75
34. T. P. Peixoto, Entropy of stochastic blockmodel ensembles, Phys. Rev. E 85, 056122 (2012). PLEEE8 1539-3755 10.1103/PhysRevE.85.056122
35. 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). PRLTAO 0031-9007 10.1103/PhysRevLett.107.065701
36. G. Bianconi, Entropy of network ensembles, Phys. Rev. E 79, 036114 (2009). PLEEE8 1539-3755 10.1103/PhysRevE.79.036114
37. T. Squartini, J. de Mol, F. den Hollander, and D. Garlaschelli, Breaking of Ensemble Equivalence in Networks, Phys. Rev. Lett. 115, 268701 (2015). PRLTAO 0031-9007 10.1103/PhysRevLett.115.268701
38. D. Garlaschelli, F. den Hollander, and A. Roccaverde, Ensemble nonequivalence in random graphs with modular structure, J. Phys. A: Math. Theor. 50, 015001 (2016). 10.1088/1751-8113/50/1/015001
39. A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model, Random Struct. Alg. 18, 116 (2001). 1042-9832 10.1002/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2
40. 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). PLEEE8 1539-3755 10.1103/PhysRevE.84.066106
41. 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). JCPSA6 0021-9606 10.1063/1.1699114
42. W. K. Hastings, Monte Carlo sampling methods using Markov chains and their applications, Biometrika 57, 97 (1970). BIOKAX 0006-3444 10.1093/biomet/57.1.97
43. P. K. Gopalan and D. M. Blei, Efficient discovery of overlapping communities in massive networks, Proc. Natl. Acad. Sci. USA 110, 14534 (2013). PNASA6 0027-8424 10.1073/pnas.1221839110
44. T. P. Peixoto, The graph-tool python library, figshare (2014), doi: 10.6084/m9.figshare.1164194.
45. Available at https://graph-tool.skewed.de.
46. 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. 1742-5468 10.1088/1742-5468/2014/05/P05007
47. S. H. Jeffreys, The Theory of Probability (Oxford University Press, Oxford, 1998).
48. D. Frenkel and B. S. Professor, Understanding Molecular Simulation: From Algorithms to Applications, 2nd ed. (Academic Press, San Diego, 2001).
49. R. M. Neal, Annealed importance sampling, Stat. Comput. 11, 125 (2001). STACE3 0960-3174 10.1023/A:1008923215028
50. F. Wang and D. P. Landau, Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States, Phys. Rev. Lett. 86, 2050 (2001). PRLTAO 0031-9007 10.1103/PhysRevLett.86.2050
51. M. Mezard and A. Montanari, Information, Physics, and Computation (Oxford University Press, Oxford, 2009).
52. 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, LinkKDD '05 (ACM, New York, 2005), pp. 36-43.
53. D. Holten, Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data, IEEE Trans. Visual. Comput. Graphics 12, 741 (2006). 1077-2626 10.1109/TVCG.2006.147
54. M. E. J. Newman, Finding community structure in networks using the eigenvectors of matrices, Phys. Rev. E 74, 036104 (2006). PLEEE8 1539-3755 10.1103/PhysRevE.74.036104
55. A. Davis and B. B. Gardner, Deep South: A Social Anthropological Study of Caste and Class, revised (University of South Carolina Press, Columbia, SC, 2009).
56. W. W. Zachary, An information flow model for conflict and fission in small groups, J. Anthropol. Res. 33, 452 (1977). 0091-7710 10.1086/jar.33.4.3629752
57. 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). 0340-5443 10.1007/s00265-003-0651-y
58. D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, 1st ed. (Addison-Wesley Professional, New York, NY/Reading, MA, 1993).
59. M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99, 7821 (2002). PNASA6 0027-8424 10.1073/pnas.122653799
60. R. E. Ulanowicz and D. L. DeAngelis, Network analysis of trophic dynamics in south florida ecosystems, U.S. Geological Survey Program on the South Florida Ecosystem 114 (2005).
61. L. C Freeman, C. M. Webster, and D. M. Kirke, Exploring social structure using dynamic three-dimensional color images, Social Networks 20, 109 (1998). 0378-8733 10.1016/S0378-8733(97)00016-6
62. J. G. White, E. Southgate, J. N. Thomson, and S. Brenner, The structure of the nervous system of the nematode Caenorhabditis elegans, Philos. Trans. R. Soc. London B 314, 1 (1986). PTRBAE 0962-8436 10.1098/rstb.1986.0056
63. M. E. J. Newman, Modularity and community structure in networks, Proc. Natl. Acad. Sci. USA 103, 8577 (2006). PNASA6 0027-8424 10.1073/pnas.0601602103
64. J. Kunegis, KONECT: The Koblenz Network Collection, in Proceedings of the 22Nd International Conference on World Wide Web, WWW '13 Companion (ACM, New York, NY, 2013), pp. 1343.
65. D. B. Larremore, A. Clauset, and C. O. Buckee, A network approach to analyzing highly recombinant malaria parasite genes, PLOS Comput. Biol. 9, e1003268 (2013). 1553-7358 10.1371/journal.pcbi.1003268
66. R. Guimerà, L. Danon, A. Díaz-Guilera, F. Giralt, and A. Arenas, Self-similar community structure in a network of human interactions, Phys. Rev. E 68, 065103 (2003). 1063-651X 10.1103/PhysRevE.68.065103
67. U. Stelzl, U. Worm, M. Lalowski, C. Haenig, F. H. Brembeck, H. Goehler, M. Stroedicke, M. Zenkner, A. Schoenherr, S. Koeppen, J. Timm, S. Mintzlaff, C. Abraham, N. Bock, S. Kietzmann, A. Goedde, E. Toksöz, A. Droege, S. Krobitsch, B. Korn, W. Birchmeier, H. Lehrach, and E. E. Wanker, A human protein-protein interaction network: A resource for annotating the proteome, Cell 122, 957 (2005). CELLB5 0092-8674 10.1016/j.cell.2005.08.029
68. D. J. Watts and S. H. Strogatz, Collective dynamics of "small-world" networks, Nature 393, 440 (1998). NATUAS 0028-0836 10.1038/30918
69. G. Joshi-Tope, M. Gillespie, I. Vastrik, P. D'Eustachio, E. Schmidt, B. de Bono, B. Jassal, G. R. Gopinath, G. R. Wu, L. Matthews, S. Lewis, E. Birney, and L. Stein, Reactome: A knowledge base of biological pathways, Nucleic Acids Res. 33, D428 (2005). 10.1093/nar/gki072
70. J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Trans. Knowl. Discov. Data 1, 2 (2007). 1556-4681 10.1145/1217299.1217301
71. P. Massa, M. Salvetti, and D. Tomasoni, Bowling Alone and Trust Decline in Social Network Sites, in Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009. DASC '09 (2009), pp. 658-663.
72. V. Batagelj, A. Mrvar, and M. Zaversnik, Network Analysis of Texts (University of Ljubljana, Slovenia, 2002), Vol. 40, p. 833.
73. L. Šubelj and M. Bajec, Model of Complex Networks Based on Citation Dynamics, in Proceedings of the 22Nd International Conference on World Wide Web, WWW '13 Companion (ACM, New York, NY, 2013), pp. 527-530.
74. J. Leskovec and J. J. Mcauley, Learning to Discover Social Circles in Ego Networks, in Advances in Neural Information Processing Systems 25, edited by F. Pereira, C. J. C. Burges, L. Bottou, and K. Q. Weinberger (Curran Associates, Inc., Red Hook, NY, 2012), pp. 539-547.
75. O. Richters and T. P. Peixoto, Trust Transitivity in Social Networks, PLoS ONE 6, e18384 (2011). 1932-6203 10.1371/journal.pone.0018384
76. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, On the Evolution of User Interaction in Facebook, in Proceedings of the 2Nd ACM Workshop on Online Social Networks, WOSN '09 (ACM, New York, NY, 2009), pp. 37-42.
77. 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, KDD '11 (ACM, New York, NY, 2011), pp. 1082-1090.
78. M. Ripeanu and I. Foster, Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems, in Peer-to-Peer Systems, Lecture Notes in Computer Science No. 2429, edited by P. Druschel, F. Kaashoek, and A. Rowstron (Springer, Berlin/Heidelberg, 2002), pp. 85-93.
79. A. E. Mislove, Online Social Networks: Measurement, Analysis, and Applications to Distributed Information Systems (ProQuest, Ann Arbor, Michigan, 2009).