Fetching the paper…
Reading the bibliography…
We demonstrate an exact equivalence between two widely used methods of community detection in networks, the method of modularity maximization in its generalized form which incorporates a resolution parameter controlling the size of the communities discovered, and the method of maximum likelihood applied to the special case of the stochastic block model known as the planted partition model, in which all communities in a network are assumed to have statistically similar properties.
B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal
1970
Earlier work this paper cites.
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. Molloy and B. Reed, A critical point for random graphs with a given degree sequence. Random Structures and Algorithms
1995
Earlier work this paper cites.
M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E
2001
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.
A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms
2001
Earlier work this paper cites.
F. McSherry, Spectral partitioning of random graphs. In Proceedings of the 42nd IEEE Symposium on the Foundations of Computer Science
2001
Earlier work this paper cites.
H. Ebel, L.-I. Mielsch, and S. Bornholdt, Scale-free topology of e-mail networks. Phys. Rev. E
2002
Earlier work this paper cites.
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. Can geographic isolation explain this unique trait? Behavioral Ecology and Sociobiology
2003
Earlier work this paper cites.
P. Gleiser and L. Danon, Community structure in jazz. Advances in Complex Systems
2003
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.
M. E. J. Newman, Fast algorithm for detecting community structure in networks. Phys. Rev. E
2004
Earlier work this paper cites.
A. Clauset, M. E. J. Newman, and C. Moore, Finding community structure in very large networks. Phys. Rev. E
2004
Earlier work this paper cites.
R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral, Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E
2004
Cited alongside, same era.
J. Duch and A. Arenas, Community detection in complex networks using extremal optimization. Phys. Rev. E
2005
Cited alongside, same era.
A. Medus, G. Acuña, and C. O. Dorso, Detection of community structures in networks via global optimization. Physica A
2005
Cited alongside, same era.
L. A. Adamic and N. Glance, The political blogosphere and the 2004 US election. In Proceedings of the WWW-2005 Workshop on the Weblogging Ecosystem
2005
Cited alongside, same era.
J. Reichardt and S. Bornholdt, Statistical mechanics of community detection. Phys. Rev. E
2006
Cited alongside, same era.
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.
Y. Zhao, E. Levina, and J. Zhu, Consistency of community detection in networks under degree-corrected stochastic block models. Annals of Statistics
2011
Later among the works it cites.
M. E. J. Newman, Communities, modules and large-scale structure in networks. Nature Physics
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. E. J. Newman, Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA
2006
Cited alongside, same era.
M. E. J. Newman, Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E
2006
Cited alongside, same era.
U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner, On finding graph clusterings with maximum modularity. In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science
2007
Cited alongside, same era.
S. Fortunato and M. Barthélemy, Resolution limit in community detection. Proc. Natl. Acad. Sci. USA
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.
M. A. Porter, J.-P. Onnela, and P. J. Mucha, Communities in networks. Notices of the American Mathematical Society
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.
M. E. J. Newman, Community detection and graph partitioning. Europhys. Lett
2013
Later among the works it cites.
M. E. J. Newman, Spectral methods for network community detection and graph partitioning. Phys. Rev. E
2013
Later among the works it cites.
P. Zhang and C. Moore, Scalable detection of statistically significant communities and hierarchies, using message passing for modularity. Proc. Natl. Acad. Sci. USA
2014
Later among the works it cites.
T. P. Peixoto, Efficient monte carlo and greedy heuristic for the inference of stochastic block models. Phys. Rev. E
2014
Later among the works it cites.
X. Yan, C. R. Shalizi, J. E. Jensen, F. Krzakala, C. Moore, L. Zdeborova, P. Zhang, and Y. Zhu, Model selection for degree-corrected block models. J. Stat. Mech
2014
Later among the works it cites.
L. Massoulié, Community detection thresholds and the weak ramanujan property. In Proceedings of the 46th Annual ACM Symposium on the Theory of Computing
2014
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.