Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
From MaRDI portal
Publication:485940
DOI10.1214/14-EJS978zbMath1308.62131arXiv1310.0532MaRDI QIDQ485940
Daniel L. Sussman, Minh Tang, Avanti Athreya, Vince Lyzinski, Carey E. Priebe
Publication date: 14 January 2015
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.0532
62H30: Classification and discrimination; cluster analysis (statistical aspects)
05C80: Random graphs (graph-theoretic aspects)
Related Items
Cites Work
- Empirical Bayes estimation for the stochastic blockmodel
- Consistency thresholds for the planted bisection model
- A limit theorem for scaled eigenvectors of random dot product graphs
- Belief propagation, robust reconstruction and optimal recovery of block models
- Universally consistent vertex classification for latent positions graphs
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Freedman's inequality for matrix martingales
- Spectral clustering and the high-dimensional stochastic blockmodel
- The method of moments and degree distributions for network models
- Strong consistency of k-means clustering
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Consistency of spectral clustering in stochastic block models
- Co-clustering separately exchangeable network data
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Latent Space Approaches to Social Network Analysis
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Random Dot Product Graph Models for Social Networks
