Fetching the paper…
Reading the bibliography…
Community detection, the division of a network into dense subnetworks with only sparse connections between them, has been a topic of vigorous study in recent years.
W. W. Zachary, An information flow model for conflict and fission in small groups. Journal of Anthropological Research
1977
Earlier work this paper cites.
P. W. Holland, K. B. Laskey, and S. Leinhardt, Stochastic blockmodels: Some first steps. Social Networks
1983
Earlier work this paper cites.
M. E. J. Newman and G. T. Barkema, Monte Carlo Methods in Statistical Physics
1999
Earlier work this paper cites.
K. Nowicki and T. A. B. Snijders, Estimation and prediction for stochastic blockstructures. J. Amer. Stat. Assoc
2001
Earlier work this paper cites.
M. Girvan and M. E. J. Newman, Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA
2002
Earlier work this paper cites.
2003
Earlier work this paper cites.
M. E. J. Newman, Fast algorithm for detecting community structure in networks. Phys. Rev. E
2004
Earlier work this paper cites.
M. E. J. Newman and M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E
2004
Earlier work this paper cites.
P. Pons and M. Latapy, Computing communities in large networks using random walks. In Proceedings of the 20th International Symposium on Computer and Information Sciences
2005
Earlier work this paper cites.
M. Rosvall and C. T. Bergstrom, An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. USA
2007
Earlier work this paper cites.
S. Fortunato and M. Barthélemy, Resolution limit in community detection. Proc. Natl. Acad. Sci. USA
2007
Earlier work this paper cites.
J. J. Daudin, F. Picard, and S. Robin, A mixture model for random graphs. Statistical Computing
2007
Cited alongside, same era.
M. S. Handcock and A. E. Raftery, Model-based clustering for social networks. J. R. Statist. Soc. A
2007
Cited alongside, same era.
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks. J. Stat. Mech
2008
Cited alongside, same era.
G. Agrawal and D. Kempe, Modularity-maximizing network communities via mathematical programming. Eur. Phys. J. B
2008
Cited alongside, same era.
B. P. Carlin and T. A. Louis, Bayesian Methods for Data Analysis
2008
Cited alongside, same era.
P. Latouche, E. Birmelé, and C. Ambroise, Bayesian methods for graph clustering. In Advances in Data Analysis, Data Handling, and Business Intelligence
B. H. Good, Y.-A. de Montjoye, and A. Clauset, Performance of modularity maximization in practical contexts. Phys. Rev. E
2010
Later among the works it cites.
C. P. Robert and G. Casella, Monte Carlo Statistical Methods
2010
Later among the works it cites.
M. Coscia, F. Giannotti, and D. Pedreschi, A classification for community discovery methods in complex networks. Statistical Analysis and Data Mining
2011
Later among the works it cites.
B. Karrer and M. E. J. Newman, Stochastic blockmodels and community structure in networks. Phys. Rev. E
2011
Later among the works it cites.
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Inference and phase transitions in the detection of modules in sparse networks. Phys. Rev. Lett
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
P. J. Bickel and A. Chen, A nonparametric view of network models and Newman–Girvan and other modularities. Proc. Natl. Acad. Sci. USA
2009
Cited alongside, same era.
R. Guimerà and M. Sales-Pardo, Missing and spurious interactions and the reconstruction of complex networks. Proc. Natl. Acad. Sci. USA
2009
Cited alongside, same era.
M. E. J. Newman, Networks: An Introduction
2010
Cited alongside, same era.
S. Fortunato, Community detection in graphs. Phys. Rep
2010
Cited alongside, same era.
Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann, Link communities reveal multiscale complexity in networks. Nature
2010
Cited alongside, same era.
Computer code for the algorithm described in this paper is available for download from the world wide web at www.umich.edu/~mejn/communities/communities.zip
Cited in the paper.
P. Latouche, E. Birmelé, and C. Ambroise, Variational Bayesian inference and complexity control for stochastic block models. Statistical Modelling
2012
Later among the works it cites.
T. P. Peixoto, Hierarchical block structures and high-resolution model selection in large networks. Phys. Rev. X
2014
Later among the works it cites.
S. Petrone, J. Rousseau, and C. Scricciolo, Bayes and emprical Bayes: Do they merge? Biometrika
2014
Later among the works it cites.
E. Côme and P. Latouche, Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood. Statistical Modelling
2015
Later among the works it cites.
T. P. Peixoto, Model selection and hypothesis testing for large-scale network models with overlapping groups. Phys. Rev. X
2015
Later among the works it cites.
E. Mossel, J. Neeman, and A. Sly, Reconstruction and estimation in the planted partition model. Probability Theory and Related Fields
2015
Later among the works it cites.