Fetching the paper…
Reading the bibliography…
The stochastic block model (SBM) with two communities, or equivalently the planted bisection model, is a popular model of random graph exhibiting a cluster behaviour.
On random graphs, I
P. Erdős and A. Rényi · 1959
Earlier work this paper cites.
On the evolution of random graphs
P. Erdős and A. Rényi · 1960
Earlier work this paper cites.
Social structure from multiple networks
H. C. White, S. A. Boorman, and R. L. Breiger · 1976
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Statistical analysis of multiple sociometric relations, 1985
S. E. Fienberg, M. M. Meyer, and S. S. Wasserman · 1985
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.
Stochastic blockmodels for directed graphs
Y. J. Wang and G. Y. Wong · 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.
Improved apprximation algorithms for maximum cut and satisfiability problems using semidefine programming
M. X. Goemans and D. P. Williamson · 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
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
M. Jerrum and G. B. Sorkin · 1998
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
A. Condon and R. M. Karp · 1999
Cited alongside, same era.
Hill-climbing finds random planted bisections
T. Carson and R. l Impagliazzo · 2001
Cited alongside, same era.
Spectral partitioning of random graphs
F. McSherry · 2001
Cited alongside, same era.
Generalized Blockmodeling (Structural Analysis in the Social Sciences)
P. Doreian, V. Batagelj, and A. Ferligoj · 2004
Cited alongside, same era.
Mixed membership stochastic blockmodels
E.M. Airoldi, D.M. Blei, S.E. Fienberg, and E.P. Xing · 2008
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.
Spectral clustering and the high-dimensional stochastic blockmodel
K.l Rohe, S. Chatterjee, and B. Yu · 2011
Later among the works it cites.
Y. Chen, S. Sanghavi, and H. Xu · 2012
Later among the works it cites.
Stochastic blockmodels with a growing number of classes
D. S. Choi, P. J. Wolfe, and E. M. Airoldi · 2012
Later among the works it cites.
Stochastic block models and reconstruction
E. Mossel, J. Neeman, and A. Sly · 2012
Later among the works it cites.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Later among the works it cites.
Efficient discovery of overlapping communities in massive networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gödel�s lost letter and p=np: Bounds on binomial coefficents
D. Lipton and K. Regan · 2009
Cited alongside, same era.
Graph partitioning via adaptive spectral techniques
A. Coja-oghlan · 2010
Cited alongside, same era.
A survey of statistical network models
A. Goldenberg, A. X. Zheng, S. E. Fienberg, and E. M. Airoldi · 2010
Cited alongside, same era.
Phase transitions for mutual information
K. R. Kumar, P. Pakzad, A.H. Salavati, and A. Shokrollahi · 2010
Cited alongside, same era.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová · 2011
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
B. Karrer and M. E. J. Newman · 2011
Cited alongside, same era.
P. K. Gopalan and D. M. Blei · 2013
Later among the works it cites.
Community detection thresholds and the weak ramanujan property
L. Massoulie · 2013
Later among the works it cites.
Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery
E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer · 2014
Closest in time.
Linear inverse problems on Erdős-Rényi graphs: Information-theoretic limits and efficient recovery
E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer · 2014
Closest in time.
A proof of the block model threshold conjecture
E. Mossel, J. Neeman, and A. Sly · 2014
Closest in time.
A simple svd algorithm for finding hidden partitions
V. Vu · 2014
Closest in time.
Edge label inference in generalized stochastic block models: from spectral theory to impossibility results
J. Xu, M. Lelarge, and L. Massoulie · 2014
Closest in time.