Finding One Community in a Sparse Graph

19 February 2015

Papers citing "Finding One Community in a Sparse Graph"

12 / 12 papers shown

Title
Phase Transitions in Sparse PCA T. Lesieur Florent Krzakala Lenka Zdeborova 82 82 0 01 Mar 2015
On the limitation of spectral methods: From the Gaussian hidden clique problem to rank one perturbations of Gaussian tensors Andrea Montanari Daniel Reichman Ofer Zeitouni 61 85 0 22 Nov 2014
Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek Yihong Wu Jiaming Xu 70 113 0 25 Jun 2014
Information-theoretically Optimal Sparse PCA Y. Deshpande Andrea Montanari 56 140 0 10 Feb 2014
Local algorithms for independent sets are half-optimal Mustazee Rahman Bálint Virág 33 90 0 03 Feb 2014
Community Detection in Sparse Random Networks E. Arias-Castro Nicolas Verzélen 109 78 0 13 Aug 2013
Spectral redemption: clustering sparse networks Florent Krzakala Cristopher Moore Elchanan Mossel Joe Neeman Allan Sly Lenka Zdeborová Pan Zhang 67 618 0 24 Jun 2013
$Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time$ Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time Y. Deshpande Andrea Montanari 57 65 0 26 Apr 2013
Limits of local algorithms over sparse random graphs D. Gamarnik Madhu Sudan 51 163 0 05 Apr 2013
Community Detection in Random Networks E. Arias-Castro Nicolas Verzélen 43 44 0 28 Feb 2013
Matrix Completion from a Few Entries Raghunandan H. Keshavan Andrea Montanari Sewoong Oh 243 1,242 0 20 Jan 2009
A Tutorial on Spectral Clustering U. V. Luxburg 184 10,497 0 01 Nov 2007