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. 1502.05680
  4. Cited By
Finding One Community in a Sparse Graph
v1v2 (latest)

Finding One Community in a Sparse Graph

19 February 2015
Andrea Montanari
ArXiv (abs)PDFHTML

Papers citing "Finding One Community in a Sparse Graph"

22 / 22 papers shown
Title
Streaming Belief Propagation for Community Detection
Streaming Belief Propagation for Community Detection
Yuchen Wu
M. Bateni
André Linhares
Filipe Almeida
Andrea Montanari
A. Norouzi-Fard
Jakab Tardos
47
2
0
09 Jun 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
Jingkai Li
T. Schramm
93
66
0
13 Sep 2020
All-or-nothing statistical and computational phase transitions in sparse
  spiked matrix estimation
All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation
Jean Barbier
N. Macris
Cynthia Rush
76
36
0
14 Jun 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
134
47
0
21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan
Guy Bresler
99
91
0
16 May 2020
The Overlap Gap Property in Principal Submatrix Recovery
The Overlap Gap Property in Principal Submatrix Recovery
D. Gamarnik
Aukosh Jagannath
S. Sen
62
29
0
26 Aug 2019
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust
  Estimation and Semirandom Adversaries
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
Matthew Brennan
Guy Bresler
133
12
0
08 Aug 2019
Convex optimization for the densest subgraph and densest submatrix
  problems
Convex optimization for the densest subgraph and densest submatrix problems
Polina Bombina
Brendan P. W. Ames
67
9
0
05 Apr 2019
Universality of Computational Lower Bounds for Submatrix Detection
Universality of Computational Lower Bounds for Submatrix Detection
Matthew Brennan
Guy Bresler
Wasim Huleihel
69
27
0
19 Feb 2019
Recovering a Single Community with Side Information
Recovering a Single Community with Side Information
H. Saad
Aria Nosratinia
56
13
0
05 Sep 2018
Reducibility and Computational Lower Bounds for Problems with Planted
  Sparse Structure
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
Matthew Brennan
Guy Bresler
Wasim Huleihel
134
110
0
19 Jun 2018
Searching for a Single Community in a Graph
Searching for a Single Community in a Graph
Avik Ray
Sujay Sanghavi
Sanjay Shakkottai
46
1
0
24 May 2018
Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
Kwangjun Ahn
Kangwook Lee
Changho Suh
76
65
0
23 May 2018
Weighted Message Passing and Minimum Energy Flow for Heterogeneous
  Stochastic Block Models with Side Information
Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information
T. Tony Cai
Tengyuan Liang
Alexander Rakhlin
66
9
0
12 Sep 2017
Community Recovery in Hypergraphs
Community Recovery in Hypergraphs
Kwangjun Ahn
Kangwook Lee
Changho Suh
70
34
0
12 Sep 2017
Community Detection and Stochastic Block Models
Community Detection and Stochastic Block Models
Emmanuel Abbe
188
1,200
0
29 Mar 2017
Constrained Low-rank Matrix Estimation: Phase Transitions, Approximate
  Message Passing and Applications
Constrained Low-rank Matrix Estimation: Phase Transitions, Approximate Message Passing and Applications
T. Lesieur
Florent Krzakala
Lenka Zdeborová
161
130
0
03 Jan 2017
The Power of Side-information in Subgraph Detection
The Power of Side-information in Subgraph Detection
Arun Kadavankandy
Konstantin Avrachenkov
L. Cottatellucci
R. Sundaresan
60
14
0
10 Nov 2016
Detection in the stochastic block model with multiple clusters: proof of
  the achievability conjectures, acyclic BP, and the information-computation
  gap
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
Information Limits for Recovering a Hidden Community
Bruce Hajek
Yihong Wu
Jiaming Xu
85
76
0
25 Sep 2015
Asymptotic Mutual Information for the Two-Groups Stochastic Block Model
Asymptotic Mutual Information for the Two-Groups Stochastic Block Model
Y. Deshpande
Emmanuel Abbe
Andrea Montanari
145
56
0
30 Jul 2015
Inference of hidden structures in complex physical systems by
  multi-scale clustering
Inference of hidden structures in complex physical systems by multi-scale clustering
Z. Nussinov
P. Ronhovde
Dandan Hu
S. Chakrabarty
M. Sahu
Bo Sun
Nicholas A. Mauro
K. Sahu
AI4CE
48
14
0
05 Mar 2015
1