Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
From MaRDI portal
Publication:485940
DOI10.1214/14-EJS978zbMath1308.62131arXiv1310.0532OpenAlexW2963582232MaRDI QIDQ485940
Carey E. Priebe, Vince Lyzinski, Daniel L. Sussman, Avanti Athreya, Minh Tang
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80)
Related Items (26)
Overlapping community detection in networks via sparse spectral decomposition ⋮ Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Spectral graph clustering via the expectation-solution algorithm ⋮ Robust Recommendation via Social Network Enhanced Matrix Completion ⋮ Unnamed Item ⋮ Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals ⋮ Vertex nomination schemes for membership prediction ⋮ Vertex nomination, consistent estimation, and adversarial modification ⋮ Estimating a network from multiple noisy realizations ⋮ Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Statistical inference on random dot product graphs: a survey ⋮ Unnamed Item ⋮ On estimation and inference in latent structure random graphs ⋮ Unnamed Item ⋮ Limit theorems for eigenvectors of the normalized Laplacian for random graphs ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes ⋮ Unnamed Item ⋮ Analysis of spectral clustering algorithms for community detection: the general bipartite setting ⋮ The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics ⋮ Consistency of spectral clustering in stochastic block models ⋮ Unnamed Item ⋮ Empirical Bayes estimation for the stochastic blockmodel
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
This page was built for publication: Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
