ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1406.6625
  4. Cited By
Computational Lower Bounds for Community Detection on Random Graphs

Computational Lower Bounds for Community Detection on Random Graphs

25 June 2014
Bruce Hajek
Yihong Wu
Jiaming Xu
ArXivPDFHTML

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

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