$Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(|E| \log^*|V|)$ Time$

v1v2v3v4 (latest)

Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(|E| \log^*|V|)$ Time

9 October 2015

Jiaming Xu

ArXiv (abs)PDF HTML

Papers citing "Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(|E| \log^*|V|)$ Time"

9 / 9 papers shown

Title
Spectral Algorithms Optimally Recover Planted Sub-structures Souvik Dhara Julia Gaudio Elchanan Mossel Colin Sandon 42 4 0 22 Mar 2022
Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits Yihong Wu Jiaming Xu 130 39 0 31 May 2018
Community Detection and Stochastic Block Models Emmanuel Abbe 188 1,200 0 29 Mar 2017
The Power of Side-information in Subgraph Detection Arun Kadavankandy Konstantin Avrachenkov L. Cottatellucci R. Sundaresan 60 14 0 10 Nov 2016
Semidefinite Programs for Exact Recovery of a Hidden Community Bruce Hajek Yihong Wu Jiaming Xu 161 32 0 20 Feb 2016
Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap Emmanuel Abbe Colin Sandon 183 120 0 30 Dec 2015
Information Limits for Recovering a Hidden Community Bruce Hajek Yihong Wu Jiaming Xu 85 76 0 25 Sep 2015
Density Evolution in the Degree-correlated Stochastic Block Model Elchanan Mossel Jiaming Xu 165 36 0 10 Sep 2015
Local Algorithms for Block Models with Side Information Elchanan Mossel Jiaming Xu 95 49 0 10 Aug 2015