Sparse random graphs: regularization and concentration of the Laplacian

Sparse random graphs: regularization and concentration of the Laplacian

10 February 2015

Elizaveta Levina

Roman Vershynin

Papers citing "Sparse random graphs: regularization and concentration of the Laplacian"

12 / 12 papers shown

Title
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming Bruce Hajek Yihong Wu Jiaming Xu 363 252 0 24 Nov 2014
Community detection in sparse networks via Grothendieck's inequality O. Guédon Roman Vershynin 130 212 0 17 Nov 2014
On semidefinite relaxations for the block model Arash A. Amini Elizaveta Levina 145 165 0 21 Jun 2014
Spectral Clustering of Graphs with the Bethe Hessian Alaa Saade Florent Krzakala Lenka Zdeborová 101 149 0 07 Jun 2014
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes T. Tony Cai Xiaodong Li 206 141 0 23 Apr 2014
Consistency of spectral clustering in stochastic block models Jing Lei Alessandro Rinaldo 185 607 0 07 Dec 2013
Impact of regularization on Spectral Clustering Antony Joseph Bin Yu 138 164 0 05 Dec 2013
Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel Tai Qin Karl Rohe 129 303 0 16 Sep 2013
Spectral redemption: clustering sparse networks Florent Krzakala Cristopher Moore Elchanan Mossel Joe Neeman Allan Sly Lenka Zdeborová Pan Zhang 117 621 0 24 Jun 2013
Improved Graph Clustering Yudong Chen Sujay Sanghavi Huan Xu 191 190 0 11 Oct 2012
Pseudo-likelihood methods for community detection in large sparse networks Arash A. Amini Aiyou Chen Peter J. Bickel Elizaveta Levina 210 408 0 10 Jul 2012
Spectral clustering and the high-dimensional stochastic blockmodel Karl Rohe S. Chatterjee Bin Yu 252 934 0 09 Jul 2010