Estimating the number of communities by spectral methods
From MaRDI portal
Publication:90067
DOI10.1214/21-ejs1971zbMath1493.62313arXiv1507.00827OpenAlexW4285193794MaRDI QIDQ90067
Elizaveta Levina, Can M. Le, Can M. Le, Can M. Le
Publication date: 1 January 2022
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.00827
Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items
Optimal Estimation of the Number of Network Communities, Universal rank inference via residual subsampling with application to large networks, Estimating a network from multiple noisy realizations, Spectral clustering in the dynamic stochastic block model, Unnamed Item, Adjusted chi-square test for degree-corrected block models, nett, Extended stochastic block models with application to criminal networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Likelihood-based model selection for stochastic block models
- Network cross-validation by edge sampling
- Network Cross-Validation for Determining the Number of Communities in Network Data
- Belief propagation, robust reconstruction and optimal recovery of block models
- Reconstruction and estimation in the planted partition model
- Spectral clustering and the high-dimensional stochastic blockmodel
- A proof of the block model threshold conjecture
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- Random matrices: universality of ESDs and the circular law
- Spectral radii of sparse random matrices
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral redemption in clustering sparse networks
- Mixed membership stochastic blockmodels
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- A Simple SVD Algorithm for Finding Hidden Partitions
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Corrected Bayesian Information Criterion for Stochastic Block Models
- Variational Bayesian inference and complexity control for stochastic block models
- The non-backtracking spectrum of the universal cover of a graph
- Community detection thresholds and the weak Ramanujan property
- Concentration and regularization of random graphs
- Hypothesis Testing for Automated Community Detection in Networks
- A goodness-of-fit test for stochastic block models
