Performance of a community detection algorithm based on semidefinite programming

Stochastic blockmodels: First steps

Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983

Earlier work this paper cites.

Cones of matrices and set-functions and 0-1 optimization

László Lovász and Alexander Schrijver · 1991

Earlier work this paper cites.

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Michel X Goemans and David P Williamson · 1995

Earlier work this paper cites.

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

Samuel Burer and Renato DC Monteiro · 2003

Earlier work this paper cites.

Finding community structure in very large networks

Aaron Clauset, Mark EJ Newman, and Cristopher Moore · 2004

Earlier work this paper cites.

On non-approximability for quadratic programs

Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, and Muli Safra · 2005

Earlier work this paper cites.

The m-component spin glass on a bethe lattice

A Braun and T Aspelmeier · 2006

Earlier work this paper cites.

Modularity and community structure in networks

Mark EJ Newman · 2006

Earlier work this paper cites.

Community detection in graphs

Santo Fortunato · 2010

Cited alongside, same era.

Low-rank optimization on the cone of positive semidefinite matrices

Michel Journée, Francis Bach, P-A Absil, and Rodolphe Sepulchre · 2010

Cited alongside, same era.

Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications

Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011

Cited alongside, same era.

Inference and phase transitions in the detection of modules in sparse networks

Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011

Cited alongside, same era.

Spectral redemption in clustering sparse networks

Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, and Pan Zhang · 2013

Cited alongside, same era.

A proof of the block model threshold conjecture

Spectral clustering of graphs with the bethe hessian

Alaa Saade, Florent Krzakala, and Lenka Zdeborová · 2014

Later among the works it cites.

Scalable detection of statistically significant communities and hierarchies, using message passing for modularity

Pan Zhang and Cristopher Moore · 2014

Later among the works it cites.

Community detection in sparse networks via grothendieck’s inequality

Olivier Guédon and Roman Vershynin · 2015

Later among the works it cites.

Limitations in the spectral method for graph partitioning: Detectability threshold and localization of eigenvectors

Tatsuro Kawamoto and Yoshiyuki Kabashima · 2015

Later among the works it cites.

Multiple phases in modularity-based community detection

Christophe Schülke and Federico Ricci-Tersenghi · 2015

Later among the works it cites.

Exact recovery in the stochastic block model