Fetching the paper…
Reading the bibliography…
We study a random graph model named the "block model" in statistics and the "planted partition model" in theoretical computer science.
Additional limit theorems for indecomposable multidimensional Galton-Watson processes
H. Kesten and B. P. Stigum · 1966
Earlier work this paper cites.
Branching processes
K. B. Athreya and P. 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.
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.
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 · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
Binomial approximation to the poisson binomial distribution: The krawtchouk expansion
B. Roos · 2001
Earlier work this paper cites.
Exploring complex networks
S.H. Strogatz · 2001
Cited alongside, same era.
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Maciej Liśkiewicz, Mitsunori Ogihara, and Seinosuke Toda · 2003
Cited alongside, same era.
Spectral techniques applied to sparse random graphs
Uriel Feige and Eran Ofek · 2005
Cited alongside, same era.
High degree vertices and eigenvalues in the preferential attachment graph
Abraham Flaxman, Alan Frieze, and Trevor Fenner · 2005
Cited alongside, same era.
Statistical properties of community structure in large social and information networks
J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney · 2008
Cited alongside, same era.
Random matrices: the circular law
Terence Tao and Van Vu · 2008
Cited alongside, same era.
Spectral statistics of erdős-rényi graphs ii: eigenvalue spacing and the extreme eigenvalues
László Erdős, Antti Knowles, Horng-Tzer Yau, and Jun Yin · 2012
Later among the works it cites.
Graph spectra and the detectability of community structure in networks
Raj Rao Nadakuditi and Mark EJ Newman · 2012
Later among the works it cites.
Universality and the circular law for sparse random matrices
Philip Matchett Wood · 2012
Later among the works it cites.
Spectral redemption: clustering sparse networks
F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, Zdeborova L, and P. Zhang · 2013
Closest in time.
Community detection in sparse networks via grothendieck’s inequality
Olivier Guédon and Roman Vershynin · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A nonparametric view of network models and Newman-Girvan and other modularities
P.J. Bickel and A. Chen · 2009
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
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová · 2011
Cited alongside, same era.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Cited alongside, same era.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Closest in time.
Stochastic block models and reconstruction
E. Mossel, J. Neeman, and A. Sly · 2014
Closest in time.
Community detection via random and adaptive sampling
Se-Young Yun and Alexandre Proutiere · 2014
Closest in time.
A new proof of Friedman’s second eigenvalue theorem and its extension to random lifts
Charles Bordenave · 2015
Closest in time.
Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
Charles Bordenave, Marc Lelarge, and Laurent Massoulié · 2015
Closest in time.