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. 1411.4686
  4. Cited By
Community detection in sparse networks via Grothendieck's inequality

Community detection in sparse networks via Grothendieck's inequality

17 November 2014
O. Guédon
Roman Vershynin
ArXivPDFHTML

Papers citing "Community detection in sparse networks via Grothendieck's inequality"

39 / 39 papers shown
Title
Learning Laplacian Positional Encodings for Heterophilous Graphs
Learning Laplacian Positional Encodings for Heterophilous Graphs
Michael Ito
Jiong Zhu
Dexiong Chen
Danai Koutra
Jenna Wiens
154
1
0
29 Apr 2025
Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
Hongjie Chen
Jingqiu Ding
Yiding Hua
Stefan Tiegel
61
0
0
05 Mar 2025
Selecting the Number of Communities for Weighted Degree-Corrected Stochastic Block Models
Selecting the Number of Communities for Weighted Degree-Corrected Stochastic Block Models
Yucheng Liu
Xiaodong Li
46
0
0
08 Jun 2024
Differentially-Private Hierarchical Clustering with Provable
  Approximation Guarantees
Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees
Jacob Imola
Alessandro Epasto
Mohammad Mahdian
Vincent Cohen-Addad
Vahab Mirrokni
26
4
0
31 Jan 2023
Private estimation algorithms for stochastic block models and mixture
  models
Private estimation algorithms for stochastic block models and mixture models
Hongjie Chen
Vincent Cohen-Addad
Tommaso dÓrsi
Alessandro Epasto
Jacob Imola
David Steurer
Stefan Tiegel
FedML
43
20
0
11 Jan 2023
Semidefinite programming on population clustering: a global analysis
Semidefinite programming on population clustering: a global analysis
Shuheng Zhou
18
1
0
01 Jan 2023
Minimax Rates for Robust Community Detection
Minimax Rates for Robust Community Detection
Allen Liu
Ankur Moitra
22
13
0
25 Jul 2022
Semi-Supervised Clustering of Sparse Graphs: Crossing the
  Information-Theoretic Threshold
Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold
Jun Sheng
Thomas Strohmer
25
0
0
24 May 2022
abess: A Fast Best Subset Selection Library in Python and R
abess: A Fast Best Subset Selection Library in Python and R
Jin Zhu
Xueqin Wang
Liyuan Hu
Junhao Huang
Kangkang Jiang
Yanhang Zhang
Shiyun Lin
Junxian Zhu
21
22
0
19 Oct 2021
Uncertainty quantification and testing in a stochastic block model with
  two unequal communities
Uncertainty quantification and testing in a stochastic block model with two unequal communities
J. van Waaij
B. Kleijn
21
1
0
18 May 2021
Spectral clustering via adaptive layer aggregation for multi-layer
  networks
Spectral clustering via adaptive layer aggregation for multi-layer networks
Sihan Huang
Haolei Weng
Yang Feng
28
21
0
07 Dec 2020
Fractal Gaussian Networks: A sparse random graph model based on Gaussian
  Multiplicative Chaos
Fractal Gaussian Networks: A sparse random graph model based on Gaussian Multiplicative Chaos
Subhro Ghosh
Krishnakumar Balasubramanian
Xiaochuan Yang
16
3
0
07 Aug 2020
Edgeworth expansions for network moments
Edgeworth expansions for network moments
Yuan Zhang
Dong Xia
32
25
0
14 Apr 2020
On the optimality of kernels for high-dimensional clustering
On the optimality of kernels for high-dimensional clustering
L. C. Vankadara
D. Ghoshdastidar
26
11
0
01 Dec 2019
Community detection in the sparse hypergraph stochastic block model
Community detection in the sparse hypergraph stochastic block model
Soumik Pal
Yizhe Zhu
14
33
0
11 Apr 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
32
9
0
05 Apr 2019
Mean Estimation with Sub-Gaussian Rates in Polynomial Time
Mean Estimation with Sub-Gaussian Rates in Polynomial Time
Samuel B. Hopkins
18
79
0
19 Sep 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
24
62
0
23 May 2018
Two provably consistent divide and conquer clustering algorithms for
  large networks
Two provably consistent divide and conquer clustering algorithms for large networks
Soumendu Sundar Mukherjee
Purnamrita Sarkar
Peter J. Bickel
23
12
0
18 Aug 2017
Provable Estimation of the Number of Blocks in Block Models
Provable Estimation of the Number of Blocks in Block Models
Bowei Yan
Purnamrita Sarkar
Xiuyuan Cheng
27
32
0
24 May 2017
Exponential error rates of SDP for block models: Beyond Grothendieck's
  inequality
Exponential error rates of SDP for block models: Beyond Grothendieck's inequality
Yingjie Fei
Yudong Chen
22
35
0
23 May 2017
Adaptive Clustering through Semidefinite Programming
Adaptive Clustering through Semidefinite Programming
Martin Royer
29
30
0
18 May 2017
Optimal graphon estimation in cut distance
Optimal graphon estimation in cut distance
Olga Klopp
Nicolas Verzélen
21
29
0
15 Mar 2017
Resilience: A Criterion for Learning in the Presence of Arbitrary
  Outliers
Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers
Jacob Steinhardt
Moses Charikar
Gregory Valiant
39
138
0
15 Mar 2017
Four lectures on probabilistic methods for data science
Four lectures on probabilistic methods for data science
Roman Vershynin
14
25
0
20 Dec 2016
Learning from Untrusted Data
Learning from Untrusted Data
Moses Charikar
Jacob Steinhardt
Gregory Valiant
FedML
OOD
19
292
0
07 Nov 2016
Message-passing algorithms for synchronization problems over compact
  groups
Message-passing algorithms for synchronization problems over compact groups
Amelia Perry
Alexander S. Wein
Afonso S. Bandeira
Ankur Moitra
31
81
0
14 Oct 2016
Performance of a community detection algorithm based on semidefinite
  programming
Performance of a community detection algorithm based on semidefinite programming
Adel Javanmard
Andrea Montanari
F. Ricci-Tersenghi
11
20
0
30 Mar 2016
Reconstructing undirected graphs from eigenspaces
Reconstructing undirected graphs from eigenspaces
Yohann De Castro
T. Espinasse
Paul Rochet
18
8
0
26 Mar 2016
Analysis of Testing-Based Forward Model Selection
Analysis of Testing-Based Forward Model Selection
Damian Kozbur
28
9
0
08 Dec 2015
Local Algorithms for Block Models with Side Information
Local Algorithms for Block Models with Side Information
Elchanan Mossel
Jiaming Xu
30
49
0
10 Aug 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
27
56
0
30 Jul 2015
A semidefinite program for unbalanced multisection in the stochastic
  block model
A semidefinite program for unbalanced multisection in the stochastic block model
William Perry
Alexander S. Wein
21
49
0
20 Jul 2015
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming:
  Extensions
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
Bruce Hajek
Yihong Wu
Jiaming Xu
43
136
0
26 Feb 2015
Reconstruction in the Labeled Stochastic Block Model
Reconstruction in the Labeled Stochastic Block Model
Marc Lelarge
Laurent Massoulié
Jiaming Xu
29
39
0
11 Feb 2015
Sparse random graphs: regularization and concentration of the Laplacian
Sparse random graphs: regularization and concentration of the Laplacian
Can M. Le
Elizaveta Levina
Roman Vershynin
39
56
0
10 Feb 2015
Improved Graph Clustering
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
94
191
0
11 Oct 2012
Asymptotic normality of maximum likelihood and its variational
  approximation for stochastic blockmodels
Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
Peter J. Bickel
David S. Choi
Xiangyu Chang
Hai Zhang
71
220
0
04 Jul 2012
Singular vectors under random perturbation
Singular vectors under random perturbation
V. Vu
96
74
0
12 Apr 2010
1