Fetching the paper…
Reading the bibliography…
We consider the problem of identifying underlying community-like structures in graphs.
On random graphs. I
P. Erdös and A. Renyi · 1959
Earlier work this paper cites.
Graph bisection algorithms with good average case behavior
T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser · 1984
Earlier work this paper cites.
Eigenvalues and graph bisection: An average-case analysis
R. B. Boppana · 1987
Earlier work this paper cites.
Improved approximation algorithms for max k-cut and max bisection
A. M. Frieze and M. Jerrum · 1995
Earlier work this paper cites.
A spectral technique for coloring random 3-colorable graphs
N. Alon and N. Kahale · 1997
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 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.
Heuristics for semirandom graph problems
U. Feige and J. Kilian · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
Near-optimal algorithms for unique games
M. Charikar, K. Makarychev, and Y. Makarychev · 2006
Earlier work this paper cites.
Partitioning graphs into balanced components
R. Krauthgamer, J. Naor, and R. Schwartz · 2009
Earlier work this paper 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
Cited alongside, same era.
Stochastic Block Models and Reconstruction
E. Mossel, J. Neeman, and A. Sly · 2012
Cited alongside, same era.
Community Detection in Random Networks
E. Arias-Castro and N. Verzelen · 2013
Cited alongside, same era.
A proof of the block model threshold conjecture
E. Mossel, J. Neeman, and A. Sly · 2013
Cited alongside, same era.
Exact recovery in the stochastic block model
E. Abbe, A. S. Bandeira, and G. Hall · 2014
Cited alongside, same era.
Consistency thresholds for binary symmetric block models
E. Mossel, J. Neeman, and A. Sly · 2014
Later among the works it cites.
A simple SVD algorithm for finding hidden partitions
V. Vu · 2014
Later among the works it cites.
Accurate community detection in the stochastic block model via spectral algorithms
S.-Y. Yun and A. Proutiere · 2014
Later among the works it cites.
Relax, no need to round: integrality of clustering formulations
P. Awasthi, A. S. Bandeira, M. Charikar, R. Krishnaswamy, S Villar, and R. Ward · 2015
Closest in time.
E. Abbe and C. Sandon · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Multireference alignment using semidefinite programming
A. S. Bandeira, M. Charikar, A. Singer, and A. Zhu · 2014
Cited alongside, same era.
Y. Chen and J. Xu · 2014
Cited alongside, same era.
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
B. Hajek, Y. Wu, and J. Xu · 2014
Cited alongside, same era.
Community detection thresholds and the weak ramanujan property
L. Massoulié · 2014
Cited alongside, same era.
Constant factor approximation for balanced cut in the PIE model
K. Makarychev, Y. Makarychev, and A. Vijayaraghavan · 2014
Cited alongside, same era.
Belief propagation, robust reconstruction and optimal recovery of block models
E. Mossel, J. Neeman, and A. Sly · 2014
Cited alongside, same era.
Closest in time.
Random Laplacian matrices and convex relaxations
A. S. Bandeira · 2015
Closest in time.
Non-unique games over compact groups and orientation estimation in cryo-em
A. S. Bandeira, Y. Chen, and A. Singer · 2015
Closest in time.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
A. S. Bandeira and R. v. Handel · 2015
Closest in time.
P. Chin, A. Rao, and V. Vu · 2015
Closest in time.
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.