Learning sparse graphons and the generalized Kesten-Stigum threshold
From MaRDI portal
Publication:6172190
DOI10.1214/23-aos2262arXiv2006.07695OpenAlexW3035108355MaRDI QIDQ6172190
Shuangping Li, Allan Sly, Emmanuel Abbe
Publication date: 19 July 2023
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.07695
Cites Work
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Rate-optimal graphon estimation
- Belief propagation, robust reconstruction and optimal recovery of block models
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Reconstruction and estimation in the planted partition model
- Oracle inequalities for network models and sparse graphon estimation
- Spectral clustering and the high-dimensional stochastic blockmodel
- The method of moments and degree distributions for network models
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Automorphic forms and geometry of arithmetic varieties
- Multivariate sampling and the estimation problem for exchangeable arrays
- Information flow on trees
- An impossibility result for reconstruction in the degree-corrected stochastic block model
- A proof of the block model threshold conjecture
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Non-backtracking spectra of weighted inhomogeneous random graphs
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral redemption in clustering sparse networks
- The solution of some random NP-hard problems in polynomial expected time
- Graph Partitioning via Adaptive Spectral Techniques
- Recovering a function from a finite number of moments
- Community Detection and Stochastic Block Models
- Proof of the Achievability Conjectures for the General Stochastic Block Model
- Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
- The Largest Eigenvalue of Sparse Random Graphs
- Graph Powering and Spectral Robustness
- Local linear graphon estimation using covariates
- Community detection thresholds and the weak Ramanujan property
- The phase transition in inhomogeneous random graphs
- Estimating network edge probabilities by neighbourhood smoothing
- A Limit Theorem for Multidimensional Galton-Watson Processes
