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. 1308.2955
  4. Cited By
Community Detection in Sparse Random Networks
v1v2 (latest)

Community Detection in Sparse Random Networks

13 August 2013
E. Arias-Castro
Nicolas Verzélen
ArXiv (abs)PDFHTML

Papers citing "Community Detection in Sparse Random Networks"

28 / 28 papers shown
Title
Likelihood ratio tests in random graph models with increasing dimensions
Likelihood ratio tests in random graph models with increasing dimensions
Ting Yan
Yuanzhang Li
Jinfeng Xu
Yaning Yang
Ji Zhu
18
0
0
10 Nov 2023
Localized geometry detection in scale-free random graphs
Localized geometry detection in scale-free random graphs
G. Bet
Riccardo Michielan
C. Stegehuis
60
0
0
06 Mar 2023
Heterogeneous Dense Subhypergraph Detection
Heterogeneous Dense Subhypergraph Detection
Mingao Yuan
Zuofeng Shang
42
3
0
08 Apr 2021
Optimality of Graph Scanning Statistic for Online Community Detection
Optimality of Graph Scanning Statistic for Online Community Detection
Liyan Xie
Yao Xie
20
1
0
11 Feb 2021
Testing correlation of unlabeled random graphs
Testing correlation of unlabeled random graphs
Yihong Wu
Jiaming Xu
Sophie H. Yu
65
36
0
23 Aug 2020
Hypergraph reconstruction from network data
Hypergraph reconstruction from network data
Jean-Gabriel Young
G. Petri
Tiago P. Peixoto
109
105
0
11 Aug 2020
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
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
Detecting a botnet in a network
Detecting a botnet in a network
G. Bet
K. Bogerd
Rui M. Castro
R. Hofstad
44
3
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
SIMPLE: Statistical Inference on Membership Profiles in Large Networks
SIMPLE: Statistical Inference on Membership Profiles in Large Networks
Jianqing Fan
Yingying Fan
Xiao Han
Jinchi Lv
82
43
0
03 Oct 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
Revisiting clustering as matrix factorisation on the Stiefel manifold
Revisiting clustering as matrix factorisation on the Stiefel manifold
Stéphane Chrétien
Benjamin Guedj
56
3
0
11 Mar 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
Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models
Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models
Amelia Perry
Alexander S. Wein
Afonso S. Bandeira
Ankur Moitra
84
110
0
02 Jul 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
Two-sample Hypothesis Testing for Inhomogeneous Random Graphs
Two-sample Hypothesis Testing for Inhomogeneous Random Graphs
Debarghya Ghoshdastidar
Maurilio Gutzeit
Alexandra Carpentier
U. V. Luxburg
87
57
0
04 Jul 2017
Spectral clustering in the dynamic stochastic block model
Spectral clustering in the dynamic stochastic block model
Marianna Pensky
Teng Zhang
99
77
0
02 May 2017
Information-theoretic bounds and phase transitions in clustering, sparse
  PCA, and submatrix localization
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization
Jessica E. Banks
Cristopher Moore
Nicolas Verzélen
Roman Vershynin
Jiaming Xu
114
75
0
18 Jul 2016
Reconstructing undirected graphs from eigenspaces
Reconstructing undirected graphs from eigenspaces
Yohann De Castro
T. Espinasse
Paul Rochet
84
8
0
26 Mar 2016
The Kato--Temple inequality and eigenvalue concentration with
  applications to graph inference
The Kato--Temple inequality and eigenvalue concentration with applications to graph inference
Joshua Cape
M. Tang
Carey E. Priebe
53
7
0
19 Mar 2016
Finding One Community in a Sparse Graph
Finding One Community in a Sparse Graph
Andrea Montanari
109
69
0
19 Feb 2015
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
Computational barriers in minimax submatrix detection
Computational barriers in minimax submatrix detection
Zongming Ma
Yihong Wu
243
152
0
23 Sep 2013
1