Fetching the paper…
Reading the bibliography…
The planted partition model (also known as the stochastic blockmodel) is a classical cluster-exhibiting random graph model that has been extensively studied in statistics, physics, and computer science.
The Poisson approximation to the Poisson binomial distribution
J.L. Hodges and L. Le Cam · 1960
Earlier work this paper cites.
A limit theorem for multidimensional Galton-Watson processes
H. Kesten and B.P. Stigum · 1966
Earlier work this paper cites.
Hierarchical clustering schemes
S.C. Johnson · 1967
Earlier work this paper cites.
Some simplified NP-complete graph problems
M.R. Garey, D.S. Johnson, and L. Stockmeyer · 1976
Earlier work this paper cites.
Maximum likelihood from incomplete data via the em algorithm
A.P. Dempster, N.M. Laird, and D.B. Rubin · 1977
Earlier work this paper cites.
Stochastic blockmodels: First steps
P.W. Holland, K.B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Eigenvalues and graph bisection: An average-case analysis
R.B. Boppana · 1987
Earlier work this paper cites.
Graph bisection algorithms with good average case behavior
T.N. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser · 1987
Earlier work this paper cites.
The solution of some random NP-hard problems in polynomial expected time
M.E. Dyer and A.M. Frieze · 1989
Earlier work this paper cites.
Almost all cubic graphs are Hamiltonian
R.W. Robinson and N.C. Wormald · 1992
Earlier work this paper cites.
Almost all regular graphs are Hamiltonian
R.W. Robinson and N.C. Wormald · 1994
Earlier work this paper cites.
On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice
P.M. Bleher, J. Ruiz, and V.A. Zagrebnov · 1995
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
Cited alongside, same era.
Nearest-neighbor walks with low predictability profile and percolation in 2 + ϵ 2+\epsilon dimensions
Olle Häggström and Elchanan Mossel · 1998
Cited alongside, same era.
The Metropolis algorithm for graph bisection
M. Jerrum and G.B. Sorkin · 1998
Cited alongside, same era.
Image processing: Analysis and machine vision
M. Sonka, V. Hlavac, and R. Boyle · 1998
Cited alongside, same era.
Models of random regular graphs
N.C. Wormald · 1999
Cited alongside, same era.
Broadcasting on trees and the Ising model
W. Evans, C. Kenyon, Y. Peres, and L.J. Schulman · 2000
Cited alongside, same era.
Exploring complex networks
S.H. Strogatz · 2001
Later among the works it cites.
Random graph models of social networks
M.E.J. Newman, D.J. Watts, and S.H. Strogatz · 2002
Later among the works it cites.
Survey – information flow on trees
E. Mossel · 2004
Later among the works it cites.
Finding and evaluating community structure in networks
M.E.J. Newman and M. Girvan · 2004
Later among the works it cites.
A proof of Alon’s second eigenvalue conjecture and related problems
Joel Friedman · 2008
Later among the works it cites.
Statistical properties of community structure in large social and information networks
J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A clustering algorithm based on graph connectivity
E. Hartuv and R. Shamir · 2000
Cited alongside, same era.
Inference of population structure using multilocus genotype data
J.K. Pritchard, M. Stephens, and P. Donnelly · 2000
Cited alongside, same era.
Normalized cuts and image segmentation
J. Shi and J. Malik · 2000
Cited alongside, same era.
Random Graphs
B. Bollobás · 2001
Cited alongside, same era.
Algorithms for graph partitioning on the planted partition model
A. Condon and R.M. Karp · 2001
Cited alongside, same era.
Spectral partitioning of random graphs
F. McSherry · 2001
Cited alongside, same era.
A nonparametric view of network models and Newman-Girvan and other modularities
P.J. Bickel and A. Chen · 2009
Later among the works it cites.
Graph partitioning via adaptive spectral techniques
A. Coja-Oghlan · 2010
Later among the works it cites.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová · 2011
Later among the works it cites.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Later among the works it cites.
Reconstruction for the Potts model
Allan Sly · 2011
Later among the works it cites.