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. 1302.7099
  4. Cited By
Community Detection in Random Networks

Community Detection in Random Networks

28 February 2013
E. Arias-Castro
Nicolas Verzélen
ArXiv (abs)PDFHTML

Papers citing "Community Detection in Random Networks"

16 / 16 papers shown
Title
Is it easier to count communities than find them?
Is it easier to count communities than find them?
Cynthia Rush
Fiona Skerman
Alexander S. Wein
Dana Yang
55
10
0
21 Dec 2022
Computational Barriers to Estimation from Low-Degree Polynomials
Computational Barriers to Estimation from Low-Degree Polynomials
T. Schramm
Alexander S. Wein
80
67
0
05 Aug 2020
Reconstructing undirected graphs from eigenspaces
Reconstructing undirected graphs from eigenspaces
Yohann De Castro
T. Espinasse
Paul Rochet
84
8
0
26 Mar 2016
Multisection in the Stochastic Block Model using Semidefinite
  Programming
Multisection in the Stochastic Block Model using Semidefinite Programming
Naman Agarwal
Afonso S. Bandeira
Konstantinos Koiliaris
A. Kolla
139
59
0
08 Jul 2015
Finding One Community in a Sparse Graph
Finding One Community in a Sparse Graph
Andrea Montanari
109
69
0
19 Feb 2015
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
Bruce Hajek
Yihong Wu
Jiaming Xu
390
252
0
24 Nov 2014
Testing for high-dimensional geometry in random graphs
Testing for high-dimensional geometry in random graphs
Sébastien Bubeck
Jian Ding
Ronen Eldan
Miklós Z. Rácz
79
129
0
20 Nov 2014
Sequential Changepoint Approach for Online Community Detection
Sequential Changepoint Approach for Online Community Detection
David Marangoni-Simonsen
Yao Xie
175
18
0
22 Jul 2014
Computational Lower Bounds for Community Detection on Random Graphs
Computational Lower Bounds for Community Detection on Random Graphs
Bruce Hajek
Yihong Wu
Jiaming Xu
164
117
0
25 Jun 2014
Statistical-Computational Tradeoffs in Planted Problems and Submatrix
  Localization with a Growing Number of Clusters and Submatrices
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
Yudong Chen
Jiaming Xu
289
216
0
06 Feb 2014
A Spectral Framework for Anomalous Subgraph Detection
A Spectral Framework for Anomalous Subgraph Detection
B. A. Miller
M. Beard
P. Wolfe
N. Bliss
65
53
0
29 Jan 2014
Optimal Testing for Planted Satisfiability Problems
Optimal Testing for Planted Satisfiability Problems
Quentin Berthet
91
8
0
09 Jan 2014
Jointly Clustering Rows and Columns of Binary Matrices: Algorithms and
  Trade-offs
Jointly Clustering Rows and Columns of Binary Matrices: Algorithms and Trade-offs
Jiaming Xu
Rui Wu
Kai Zhu
Bruce Hajek
R. Srikant
Lei Ying
202
44
0
01 Oct 2013
Computational barriers in minimax submatrix detection
Computational barriers in minimax submatrix detection
Zongming Ma
Yihong Wu
243
152
0
23 Sep 2013
Computational Lower Bounds for Sparse PCA
Computational Lower Bounds for Sparse PCA
Quentin Berthet
Philippe Rigollet
98
93
0
03 Apr 2013
Network Detection Theory and Performance
Network Detection Theory and Performance
S. Smith
K. Senne
S. Philips
E. Kao
G. Bernstein
81
22
0
22 Mar 2013
1