Computational Lower Bounds for Community Detection on Random Graphs

25 June 2014

Jiaming Xu

Papers citing "Computational Lower Bounds for Community Detection on Random Graphs"

23 / 23 papers shown

Title
Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding Tong Qi V. Lyzinski 35 0 0 18 Dec 2023
Localized geometry detection in scale-free random graphs G. Bet Riccardo Michielan C. Stegehuis 22 0 0 06 Mar 2023
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials Alexander S. Wein 27 9 0 10 Nov 2022
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics Afonso S. Bandeira A. Alaoui Samuel B. Hopkins T. Schramm Alexander S. Wein Ilias Zadik 45 28 0 19 May 2022
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning Itay Levinas Y. Louzoun 24 1 0 05 Jan 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 17 35 0 07 Dec 2021
Inferring Hidden Structures in Random Graphs Wasim Huleihel 19 7 0 05 Oct 2021
Random Subgraph Detection Using Queries Wasim Huleihel A. Mazumdar S. Pal 25 6 0 02 Oct 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins Jingkai Li T. Schramm 19 62 0 13 Sep 2020
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection Yuetian Luo Anru R. Zhang 30 14 0 12 Sep 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 35 44 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 35 86 0 16 May 2020
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 29 136 0 26 Jul 2019
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness Matthew Brennan Guy Bresler 29 50 0 20 Feb 2019
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 35 26 0 19 Feb 2019
Connectivity in Random Annulus Graphs and the Geometric Block Model Sainyam Galhotra A. Mazumdar S. Pal B. Saha 50 11 0 12 Apr 2018
Notes on computational-to-statistical gaps: predictions using statistical physics Afonso S. Bandeira Amelia Perry Alexander S. Wein AI4CE 25 57 0 29 Mar 2018
Inference in Sparse Graphs with Pairwise Measurements and Side Information Dylan J. Foster Daniel Reichman Karthik Sridharan 27 7 0 08 Mar 2017
Tensor SVD: Statistical and Computational Limits Anru R. Zhang Dong Xia 21 166 0 08 Mar 2017
The use of deep learning in image segmentation, classification and detection Mihai-Sorin Badea Iulian-Ionut Felea L. Florea C. Vertan 47 20 0 31 May 2016
Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Y. Deshpande Andrea Montanari 33 84 0 23 Feb 2015
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming Bruce Hajek Yihong Wu Jiaming Xu 63 249 0 24 Nov 2014
Statistical and computational trade-offs in estimation of sparse principal components Tengyao Wang Quentin Berthet R. Samworth 66 136 0 22 Aug 2014