Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
From MaRDI portal
Publication:2038283
DOI10.1214/19-STS736MaRDI QIDQ2038283
Publication date: 6 July 2021
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06055
Related Items (8)
Motif estimation via subgraph sampling: the fourth-moment phenomenon ⋮ Iterative algorithm for discrete structure recovery ⋮ Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising ⋮ Community detection in feature-rich networks using data recovery approach ⋮ Power enhancement and phase transitions for global testing of the mixed membership stochastic block model ⋮ Bayesian learning of graph substructures ⋮ Statistical limits of sparse mixture detection ⋮ Global and individualized community detection in inhomogeneous multilayer networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Fast community detection by SCORE
- Network Cross-Validation for Determining the Number of Communities in Network Data
- Rate-optimal graphon estimation
- Consistency thresholds for the planted bisection model
- Impact of regularization on spectral clustering
- Minimax rates of community detection in stochastic block models
- 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
- Minimax estimation in sparse canonical correlation analysis
- On the representation theorem for exchangeable arrays
- Representations for partially exchangeable arrays of random variables
- Minimax risk over \(l_ p\)-balls for \(l_ q\)-error
- An impossibility result for reconstruction in the degree-corrected stochastic block model
- Sparse CCA: adaptive estimation and computational barriers
- A proof of the block model threshold conjecture
- Adaptive estimation of the sparsity in the Gaussian vector model
- On semidefinite relaxations for the block model
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Contiguity and non-reconstruction results for planted partition models: the dense case
- Variable selection with Hamming loss
- Community detection in degree-corrected block models
- What is a statistical model? (With comments and rejoinder).
- Consistency of community detection in networks under degree-corrected stochastic block models
- Theoretical and computational guarantees of mean field variational inference for community detection
- A general framework for Bayes structured linear models
- Structured matrix estimation and completion
- Matrix estimation by universal singular value thresholding
- Consistency of spectral clustering in stochastic block models
- Role of normalization in spectral clustering for stochastic blockmodels
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Computational barriers in minimax submatrix detection
- Convexified modularity maximization for degree-corrected stochastic block models
- Consistency of spectral clustering
- Sparse PCA: optimal rates and adaptive estimation
- Random Graphs and Complex Networks
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- A nonparametric view of network models and Newman–Girvan and other modularities
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Exact Recovery in the Stochastic Block Model
- Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
- Graph Partitioning via Adaptive Spectral Techniques
- Graph limits and exchangeable random graphs
- Estimation and Prediction for Stochastic Blockstructures
- Latent Space Approaches to Social Network Analysis
- Random graph models of social networks
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- Sparse exchangeable graphs and their limits via graphon processes
- Edge Exchangeable Models for Interaction Networks
- Sparse Graphs Using Exchangeable Random Measures
- Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- How well do local algorithms solve semidefinite programs?
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- A Survey of Statistical Network Models
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Community detection thresholds and the weak Ramanujan property
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Semidefinite programs on sparse random graphs and their application to community detection
- Concentration and regularization of random graphs
- The average distances in random graphs with given expected degrees
- Elements of Information Theory
- Hypothesis Testing for Automated Community Detection in Networks
- Networks
This page was built for publication: Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
