Fetching the paper…
Reading the bibliography…
The stochastic block model is a classical cluster-exhibiting random graph model that has been widely studied in statistics, physics and computer science.
Branching Processes
Krishna B. Athreya and Peter E. Ney · 1972
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
The solution of some random NP-hard problems in polynomial expected time
Martin E. Dyer and Alan M. Frieze · 1989
Earlier work this paper cites.
Estimation and prediction for stochastic blockmodels for graphs with latent block structure
T. A. B. Snijders and K. Nowicki · 1997
Earlier work this paper cites.
The Metropolis algorithm for graph bisection
Mark Jerrum and G. B. Sorkin · 1998
Earlier work this paper cites.
Broadcasting on trees and the Ising model
William Evans, Claire Kenyon, Yuval Peres, and Leonard J. Schulman · 2000
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
A. Condon and Richard M. Karp · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
Reconstruction on trees: Beating the second eigenvalue
Elchanan Mossel · 2001
Earlier work this paper cites.
Semi-supervised clustering by seeding
Sugato Basu, Arindam Banerjee, and Raymond J Mooney · 2002
Earlier work this paper cites.
Cluster kernels for semi-supervised learning
Olivier Chapelle, Jason Weston, and Bernhard Schoelkopf · 2002
Earlier work this paper cites.
Information flow on trees
Elchanan Mossel and Yuval Peres · 2003
Cited alongside, same era.
A probabilistic framework for semi-supervised clustering
Sugato Basu, Mikhail Bilenko, and Raymond J. Mooney · 2004
Cited alongside, same era.
Survey: Information flow on trees
Elchanan Mossel · 2004
Cited alongside, same era.
Markov chains and mixing times
David A. Levin, Yuval Peres, and Elizabeth L. Wilmer · 2006
Cited alongside, same era.
A nonparametric view of network models and Newman-Girvan and other modularities
P. J. Bickel and A. Chen · 2009
Cited alongside, same era.
Reconstruction of symmetric potts models
A. Sly · 2009
Cited alongside, same era.
Community detection with and without prior information
Perfect matchings as iid factors on non-amenable groups
Russell Lyons and Fedor Nazarov · 2011
Later among the works it cites.
Limits of local-global convergent graph sequences
Hamed Hatami, László Lovász, and Balázs Szegedy · 2012
Later among the works it cites.
Stochastic block models and reconstruction
Elchanan Mossel, Joe Neeman, and Allan Sly · 2012
Later among the works it cites.
Comparitive study for inference of hidden classes in stochastic block models
Pan Zhang, Florent Krzakala, Jörg Reichardt, and Lenka Zdeborová · 2012
Later among the works it cites.
Belief propogation, robust reconstruction, and optimal recovery of block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Armen E. Allahverdyan, Greg Ver Steeg, and Aram Galstyan · 2010
Cited alongside, same era.
Graph partitioning via adaptive spectral techniques
A. Coja-Oghlan · 2010
Cited alongside, same era.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Cited alongside, same era.
Inference and phase transitions in the detection of modules in sparse networks
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Cited alongside, same era.
A proof of the block model threshold conjecture
Elchanan Mossel, Joe Neeman, and Allan Sly · 2013
Later among the works it cites.
Phase transitions in community detection: A solvable toy model
Greg Ver Steeg, Cristopher Moore, Aram Galstyan, and Armen E. Allahverdyan · 2013
Later among the works it cites.
Limits of local algorithms over sparse random graphs
David Gamarnik and Madhu Sudan · 2014
Closest in time.
Community detection thresholds and the weak Ramanujan property
Laurent Massoulié · 2014
Closest in time.
Phase transitions in semisupervised clustering of sparse networks
Pan Zhang, Cristopher Moore, and Lenka Zdeborová · 2014
Closest in time.