Fetching the paper…
Reading the bibliography…
We propose a semidefinite programming (SDP) algorithm for community detection in the stochastic block model, a popular model for networks with latent community structure.
Stochastic blockmodels: First steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Improved approximation algorithms for MAX k-CUT and MAX BISECTION
A. Frieze and M. Jerrum · 1994
Earlier work this paper cites.
Coloring random and semi-random k-colorable graphs
Avrim Blum and Joel Spencer · 1995
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M.X. Goemans and D.P. Williamson · 1995
Earlier work this paper cites.
Heuristics for semirandom graph problems
U. Feige and J. Kilian · 2001
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
Earlier work this paper cites.
Clustering sparse graphs
Y. Chen, S. Sanghavi, and H. Xu · 2012
Earlier work this paper cites.
A Proof Of The Block Model Threshold Conjecture
E. Mossel, J. Neeman, and A. Sly · 2013
Earlier work this paper cites.
On semidefinite relaxations for the block model
A. Amini and E. Levina · 2014
Earlier work this paper cites.
Improved graph clustering
Yudong Chen, Sujay Sanghavi, and Huan Xu · 2014
Cited alongside, same era.
Community detection thresholds and the weak Ramanujan property
L. Massoulié · 2014
Cited alongside, same era.
Reconstruction and estimation in the planted partition model
E. Mossel, J. Neeman, and A. Sly · 2014
Cited alongside, same era.
Multisection in the Stochastic Block Model using Semidefinite Programming
N. Agarwal, A. Bandeira, K. Koiliaris, and A Kolla · 2015
Cited alongside, same era.
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms
E. Abbe and C. Sandon · 2015
Cited alongside, same era.
Recovering communities in the general stochastic block model without knowing the parameters
Achieving exact cluster recovery threshold via semidefinite programming
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
B. Hajek, Y. Wu, and J. Xu · 2015
Closest in time.
Consistency of spectral clustering in stochastic block models
J. Lei and A. Rinaldo · 2015
Closest in time.
Exact recovery in the stochastic block model
E. Abbe, A. S. Bandeira, and G. Hall · 2016
Closest in time.
Phase transitions in semidefinite relaxations
A. Javanmard, A. Montanari, and F. Ricci-Tersenghi · 2016
Closest in time.
Learning communities in the presence of errors
K. Makarychev, Y. Makarychev, and A. Vijayaraghavan · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Abbe and C. Sandon · 2015
Cited alongside, same era.
Random laplacian matrices and convex relaxations
A. S. Bandeira · 2015
Cited alongside, same era.
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
T. Cai and X. Li · 2015
Cited alongside, same era.
Community detection in sparse networks via Grothendieck’s inequality
O. Guédon and R. Vershynin · 2015
Cited alongside, same era.
How robust are reconstruction thresholds for community detection?
A. Moitra, W. Perry, and A. S. Wein · 2016
Closest in time.
Semidefinite programs on sparse random graphs and their application to community detection
A. Montanari and S. Sen · 2016
Closest in time.
Performance of a community detection algorithm based on semidefinite programming
F. Ricci-Tersenghi, A. Javanmard, and A. Montanari · 2016
Closest in time.