A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
From MaRDI portal
Publication:4648556
DOI10.1080/01621459.2012.699795zbMath1443.62188arXiv1108.2228MaRDI 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
62H30: Classification and discrimination; cluster analysis (statistical aspects)
05C80: Random graphs (graph-theoretic aspects)
Related Items
Statistical inference on random dot product graphs: a survey, A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Vertex nomination via seeded graph matching, Unnamed Item, Unnamed Item, Unnamed Item, Testing for Equivalence of Network Distribution Using Subgraph Counts, Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering, Unnamed Item, 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, Euclidean Representation of Low-Rank Matrices and Its Geometric Properties, Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals, Network Cross-Validation for Determining the Number of Communities in Network Data, Empirical Bayes estimation for the stochastic blockmodel, A limit theorem for scaled eigenvectors of random dot product graphs, Impact of regularization on spectral clustering, Universally consistent vertex classification for latent positions graphs, Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding, Large-scale estimation of random graph models with local dependence, Vertex nomination schemes for membership prediction, Limit theorems for eigenvectors of the normalized Laplacian for random graphs, 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 the estimation of latent distances using graph distances, Extended stochastic block models with application to criminal networks, Evidential prototype-based clustering based on transfer learning, 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, Spectral graph clustering via the expectation-solution algorithm, Entrywise eigenvector analysis of random matrices with low expected rank, On Bayesian new edge prediction and anomaly detection in computer networks, Vertex nomination: the canonical sampling and the extended spectral nomination schemes, The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics, 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
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
