A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
From MaRDI portal
Publication:4648556
DOI10.1080/01621459.2012.699795zbMath1443.62188arXiv1108.2228OpenAlexW1987349051MaRDI QIDQ4648556
Minh Tang, Daniel L. Sussman, Donniell E. Fishkind, Carey E. Priebe
Publication date: 9 November 2012
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2228
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80)
Related Items (43)
Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Large-scale estimation of random graph models with local dependence ⋮ A limit theorem for scaled eigenvectors of random dot product graphs ⋮ Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Impact of regularization on spectral clustering ⋮ Testing for Equivalence of Network Distribution Using Subgraph Counts ⋮ Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering ⋮ Spectral graph clustering via the expectation-solution algorithm ⋮ Unnamed Item ⋮ Universally consistent vertex classification for latent positions graphs ⋮ Robust Recommendation via Social Network Enhanced Matrix Completion ⋮ Lead-lag detection and network clustering for multivariate time series with an application to the us equity market ⋮ Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure ⋮ Unnamed Item ⋮ Entrywise eigenvector analysis of random matrices with low expected rank ⋮ Euclidean Representation of Low-Rank Matrices and Its Geometric Properties ⋮ Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals ⋮ Vertex nomination schemes for membership prediction ⋮ Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Statistical inference on random dot product graphs: a survey ⋮ A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection ⋮ On estimation and inference in latent structure random graphs ⋮ Network representation using graph root distributions ⋮ Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees ⋮ On Bayesian new edge prediction and anomaly detection in computer networks ⋮ Limit theorems for eigenvectors of the normalized Laplacian for random graphs ⋮ On the estimation of latent distances using graph distances ⋮ Network Cross-Validation for Determining the Number of Communities in Network Data ⋮ Vertex nomination via seeded graph matching ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes ⋮ Unnamed Item ⋮ Extended stochastic block models with application to criminal networks ⋮ The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics ⋮ Unnamed Item ⋮ Consistency of spectral clustering in stochastic block models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Evidential prototype-based clustering based on transfer learning ⋮ Role of normalization in spectral clustering for stochastic blockmodels ⋮ Robust and computationally feasible community detection in the presence of arbitrary outlier nodes ⋮ Empirical Bayes estimation for the stochastic blockmodel
Cites Work
- Unnamed Item
- Modeling graphs using dot product representations
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Matrix Analysis
- Estimation and Prediction for Stochastic Blockstructures
- Latent Space Approaches to Social Network Analysis
- A Survey of Statistical Network Models
- Eigenvalue Inequalities for Matrix Product
- Random Dot Product Graph Models for Social Networks
- The Rotation of Eigenvectors by a Perturbation. III
This page was built for publication: A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
