Fetching the paper…
Reading the bibliography…
This chapter provides a self-contained introduction to the use of Bayesian inference to extract large-scale modular structures from network data, based on the stochastic blockmodel (SBM), as well as its degree-corrected and overlapping generalizations.
Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller, “Equation of State Calculations by Fast Computing Machines,” The Journal of Chemical Physics 21
1953
Earlier work this paper cites.
J. Kiefer, “Sequential Minimax Search for a Maximum,” Proceedings of the American Mathematical Society 4
1953
Earlier work this paper cites.
Paul Erdős and Alfréd Rényi, “On random graphs, I,” Publicationes Mathematicae (Debrecen) 6
1959
Earlier work this paper cites.
W. K. Hastings, “Monte Carlo sampling methods using Markov chains and their applications,” Biometrika 57
1970
Earlier work this paper cites.
H. Akaike, “A new look at the statistical model identification,” IEEE Transactions on Automatic Control 19
1974
Earlier work this paper cites.
Wayne W. Zachary, “An Information Flow Model for Conflict and Fission in Small Groups,” Journal of Anthropological Research 33
1977
Earlier work this paper cites.
J. Rissanen, “Modeling by shortest data description,” Automatica 14
1978
Earlier work this paper cites.
Gideon Schwarz, “Estimating the Dimension of a Model,” The Annals of Statistics 6
1978
Earlier work this paper cites.
F. Y. Wu, “The Potts model,” Reviews of Modern Physics 54
1982
Earlier work this paper cites.
Paul W. Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt, “Stochastic blockmodels: First steps,” Social Networks 5
1983
Earlier work this paper cites.
S. Kirkpatrick, C. D Gelatt Jr, and M. P Vecchi, “Optimization by simulated annealing,” Science 220
1983
Earlier work this paper cites.
M. Mezard, Spin Glass Theory And Beyond: An Introduction To The Replica Method And Its Applications (Wspc, Singapore ; New Jersey, 1986)
1986
Earlier work this paper cites.
Yuchung J. Wang and George Y. Wong, “Stochastic Blockmodels for Directed Graphs,” Journal of the American Statistical Association 82
1987
Earlier work this paper cites.
Yurii Mikhailovich Shtar’kov, “Universal sequential coding of single messages,” Problemy Peredachi Informatsii 23
1987
Earlier work this paper cites.
M. E Dyer and A. M Frieze, “The solution of some random NP-hard problems in polynomial expected time,” Journal of Algorithms 10
1989
Earlier work this paper cites.
Thomas M. Cover and Joy A. Thomas, Elements of Information Theory , 99th ed. (Wiley-Interscience, 1991)
1991
Earlier work this paper cites.
Tom A. B. Snijders and Krzysztof Nowicki, “Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure,” Journal of Classification 14
1997
Earlier work this paper cites.
M. E. J. Newman and G. T. Barkema, Monte Carlo Methods in Statistical Physics (Oxford University Press, U.S.A., Oxford : New York, 1999)
1999
Earlier work this paper cites.
Harold Jeffreys, Theory of Probability , auflage: third. ed. (Oxford University Press, Oxford Oxfordshire : New York, 2000)
2000
Earlier work this paper cites.
Trevor F. Cox and M. A. A. Cox, Multidimensional Scaling, Second Edition , 2nd ed. (Chapman and Hall/CRC, Boca Raton, 2000)
2000
Earlier work this paper cites.
Krzysztof Nowicki and Tom A. B Snijders, “Estimation and Prediction for Stochastic Blockstructures,” Journal of the American Statistical Association 96
2001
Earlier work this paper cites.
Anne Condon and Richard M. Karp, “Algorithms for graph partitioning on the planted partition model,” Random Structures & Algorithms 18
2001
Earlier work this paper cites.
Bo Söderberg, “General formalism for inhomogeneous random graphs,” Physical Review E 66
2002
Earlier work this paper cites.
M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences 99
2002
Earlier work this paper cites.
E. T. Jaynes, Probability Theory: The Logic of Science , edited by G. Larry Bretthorst (Cambridge University Press, Cambridge, UK ; New York, NY, 2003)
2003
Earlier work this paper cites.
Marián Boguñá and Romualdo Pastor-Satorras, “Class of correlated random networks with hidden variables,” Physical Review E 68
2003
Earlier work this paper cites.
N. J. A. Sloane, The on-line encyclopedia of integer sequences: A000670 (2003)
2003
Earlier work this paper cites.
N. J. A. Sloane, The on-line encyclopedia of integer sequences: A008277 (2003)
2003
Earlier work this paper cites.
David J. C. MacKay, Information Theory, Inference and Learning Algorithms , first edition ed. (Cambridge University Press, 2003)
2003
Earlier work this paper cites.
Roger Guimerà, Marta Sales-Pardo, and Luís A. Nunes Amaral, “Modularity from fluctuations in random graphs and complex networks,” Physical Review E 70
2004
Earlier work this paper cites.
Peter Grünwald, “A tutorial introduction to the minimum description length principle,” arXiv:math/0406077 (2004)
2004
Earlier work this paper cites.
Lada A. Adamic and Natalie 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, NY, USA, 2005) pp. 36–43
2005
Earlier work this paper cites.
Roger Guimerà and Luís A. Nunes Amaral, “Functional cartography of complex metabolic networks,” Nature 433
2005
Earlier work this paper cites.
M. B. Hastings, “Community detection as an inference problem,” Physical Review E 74
2006
Earlier work this paper cites.
Charles Kemp and Joshua B. Tenenbaum, “Learning systems of concepts with an infinite relational model,” in In Proceedings of the 21st National Conference on Artificial Intelligence (2006)
2006
Earlier work this paper cites.
D. Holten, “Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data,” IEEE Transactions on Visualization and Computer Graphics 12
2006
Cited alongside, same era.
M. E. J. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E 74
2006
Cited alongside, same era.
Béla Bollobás, Svante Janson, and Oliver Riordan, “The phase transition in inhomogeneous random graphs,” Random Structures & Algorithms 31
2007
Cited alongside, same era.
Martin Rosvall and Carl T. Bergstrom, “An information-theoretic framework for resolving community structure in complex networks,” Proceedings of the National Academy of Sciences 104
2007
Cited alongside, same era.
Peter D. Grünwald, The Minimum Description Length Principle (The MIT Press, 2007)
2007
Cited alongside, same era.
Núria Rovira-Asenjo, Tània Gumí, Marta Sales-Pardo, and Roger Guimerà, “Predicting future conflict between team-members with parameter-free models of social networks,” Scientific Reports 3
2013
Later among the works it cites.
K.S. Xu and A.O. Hero, “Dynamic Stochastic Blockmodels for Time-Evolving Social Networks,” IEEE Journal of Selected Topics in Signal Processing 8
2014
Later among the works it cites.
Xiaoran Yan, Cosma Shalizi, Jacob E. Jensen, Florent Krzakala, Cristopher Moore, Lenka Zdeborová, Pan Zhang, and Yaojia Zhu, “Model selection for degree-corrected block models,” Journal of Statistical Mechanics: Theory and Experiment 2014
2014
Later among the works it cites.
Darko Hric, Richard K. Darst, and Santo Fortunato, “Community detection in networks: Structural communities versus ground truth,” Physical Review E 90
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Santo Fortunato and Marc Barthélemy, “Resolution limit in community detection,” Proceedings of the National Academy of Sciences 104
2007
Cited alongside, same era.
J.-J. Daudin, F. Picard, and S. Robin, “A mixture model for random graphs,” Statistics and Computing 18
2008
Cited alongside, same era.
Jake M. Hofman and Chris H. Wiggins, “Bayesian Approach to Network Modularity,” Physical Review Letters 100
2008
Cited alongside, same era.
Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg, and Eric P. Xing, “Mixed Membership Stochastic Blockmodels,” J. Mach. Learn. Res. 9
2008
Cited alongside, same era.
Aaron Clauset, Cristopher Moore, and M. E. J. Newman, “Hierarchical structure and the prediction of missing links in networks,” Nature 453
2008
Cited alongside, same era.
Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi, “Benchmark graphs for testing community detection algorithms,” Physical Review E 78
2008
Cited alongside, same era.
Jörg Reichardt and Michele Leone, “(Un)detectable Cluster Structure in Sparse Networks,” Physical Review Letters 101
2008
Cited alongside, same era.
Christopher Aicher, Abigail Z. Jacobs, and Aaron Clauset, “Learning latent block structure in weighted networks,” Journal of Complex Networks , cnu026 (2014)
2014
Later among the works it cites.
Sofia C. Olhede and Patrick J. Wolfe, “Network histograms and universality of blockmodel approximation,” Proceedings of the National Academy of Sciences 111
2014
Later among the works it cites.
Etienne Côme and Pierre Latouche, “Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood,” Statistical Modelling 15
2015
Later among the works it cites.
Leto Peel and Aaron Clauset, “Detecting Change Points in the Large-Scale Structure of Evolving Networks,” in Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)
2015
Later among the works it cites.
Leto Peel, “Active discovery of network roles for predicting the classes of network nodes,” Journal of Complex Networks 3
2015
Later among the works it cites.
M. E. J. Newman and Tiago P. Peixoto, “Generalized Communities in Networks,” Physical Review Letters 115
2015
Later among the works it cites.
2016
Later among the works it cites.
M. E. J. Newman and Gesine Reinert, “Estimating the Number of Communities in a Network,” Physical Review Letters 117
2016
Later among the works it cites.
Amir Ghasemian, Pan Zhang, Aaron Clauset, Cristopher Moore, and Leto Peel, “Detectability Thresholds and Optimal Algorithms for Community Structure in Dynamic Networks,” Physical Review X 6
2016
Later among the works it cites.
Marco Corneli, Pierre Latouche, and Fabrice Rossi, “Exact ICL maximization in a non-stationary temporal extension of the stochastic block model for dynamic networks,” Neurocomputing Advances in artificial neural networks, machine learning and computational intelligenceSelected papers from the 23rd European Symposium on Artificial Neural Networks (ESANN 2015), 192
2016
Later among the works it cites.
Matias Catherine and Miele Vincent, “Statistical clustering of temporal networks through a dynamic stochastic block model,” Journal of the Royal Statistical Society: Series B (Statistical Methodology) 79
2016
Later among the works it cites.
M. E. J. Newman and Aaron Clauset, “Structure and inference in annotated networks,” Nature Communications 7
2016
Later among the works it cites.
Darko Hric, Tiago P. Peixoto, and Santo Fortunato, “Network Structure, Metadata, and the Prediction of Missing Nodes and Annotations,” Physical Review X 6
2016
Later among the works it cites.
N. Stanley, S. Shai, D. Taylor, and P. J. Mucha, “Clustering Network Layers with the Strata Multilayer Stochastic Block Model,” IEEE Transactions on Network Science and Engineering 3
2016
Later among the works it cites.
Subhadeep Paul and Yuguo Chen, “Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel,” Electronic Journal of Statistics 10
2016
Later among the works it cites.
Toni Vallès-Català, Francesco A. Massucci, Roger Guimerà, and Marta Sales-Pardo, “Multilayer Stochastic Block Models Reveal the Multilayer Structure of Complex Networks,” Physical Review X 6
2016
Later among the works it cites.
Travis Martin, Brian Ball, and M. E. J. Newman, “Structural inference for uncertain networks,” Physical Review E 93
2016
Later among the works it cites.
Lenka Zdeborová and Florent Krzakala, “Statistical physics of inference: thresholds and algorithms,” Advances in Physics 65
2016
Later among the works it cites.
Antonia Godoy-Lorite, Roger Guimerà, Cristopher Moore, and Marta Sales-Pardo, “Accurate and scalable social recommendation using mixed-membership stochastic block models,” Proceedings of the National Academy of Sciences 113
2016
Later among the works it cites.
Tiago P. Peixoto, “Nonparametric Bayesian inference of the microcanonical stochastic block model,” Physical Review E 95
2017
Closest in time.
Tiago P. Peixoto and Martin Rosvall, “Modelling sequences and temporal networks with dynamic community structures,” Nature Communications 8
2017
Closest in time.
Xiao Zhang, Cristopher Moore, and Mark E. J. Newman, “Random graph models for dynamic networks,” The European Physical Journal B 90
2017
Closest in time.
Leto Peel, Daniel B. Larremore, and Aaron Clauset, “The ground truth about metadata and community detection in networks,” Science Advances 3
2017
Closest in time.
Y. X. Rachel Wang and Peter J. Bickel, “Likelihood-based model selection for stochastic block models,” The Annals of Statistics 45
2017
Closest in time.
Diego Garlaschelli, Frank den Hollander, and Andrea Roccaverde, “Ensemble nonequivalence in random graphs with modular structure,” Journal of Physics A: Mathematical and Theoretical 50
2017
Closest in time.
Caterina De Bacco, Eleanor A. Power, Daniel B. Larremore, and Cristopher Moore, “Community detection, link prediction, and layer interdependence in multilayer networks,” Physical Review E 95
2017
Closest in time.
Maria A. Riolo, George T. Cantwell, Gesine Reinert, and M. E. J. Newman, “Efficient method for estimating the number of communities in a network,” Physical Review E 96
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
Tiago P. Peixoto, “Nonparametric weighted stochastic block models,” Physical Review E 97
2018
Closest in time.