A limit theorem for scaled eigenvectors of random dot product graphs

DOI10.1007/s13171-015-0071-xzbMath1338.62061arXiv1305.7388OpenAlexW1531677314MaRDI QIDQ288255

Daniel L. Sussman, Minh Tang, David J. Marchette, Avanti Athreya, Vince Lyzinski, Carey E. Priebe

Publication date: 25 May 2016

Published in: Sankhyā. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.7388

zbMATH Keywords

model-based clusteringcentral limit theoremrandom dot product graph

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (24)

Estimating Mixed Memberships With Sharp Eigenvector Deviations ⋮ Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming ⋮ Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering ⋮ Spectral graph clustering via the expectation-solution algorithm ⋮ Robust Recommendation via Social Network Enhanced Matrix Completion ⋮ Central limit theorems for classical multidimensional scaling ⋮ Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure ⋮ Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals ⋮ Vertex nomination, consistent estimation, and adversarial modification ⋮ Eigenvector delocalization for non‐Hermitian random matrices and applications ⋮ Bayesian estimation of the latent dimension and communities in stochastic blockmodels ⋮ Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding ⋮ Unnamed Item ⋮ Statistical inference on random dot product graphs: a survey ⋮ Fusing data depth with complex networks: community detection with prior information ⋮ On estimation and inference in latent structure random graphs ⋮ Limit theorems for eigenvectors of the normalized Laplacian for random graphs ⋮ Eigenvectors and controllability of non-Hermitian random matrices and directed graphs ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes ⋮ Community detection on mixture multilayer networks via regularized tensor decomposition ⋮ Unnamed Item ⋮ Empirical Bayes estimation for the stochastic blockmodel

Uses Software

• mclust

Cites Work

• Unnamed Item
• Unnamed Item
• Universally consistent vertex classification for latent positions graphs
• Freedman's inequality for matrix martingales
• Spectral clustering and the high-dimensional stochastic blockmodel
• The method of moments and degree distributions for network models
• Representations for partially exchangeable arrays of random variables
• The eigenvalues of random symmetric matrices
• Eigenvector distribution of Wigner matrices
• MCLUST: Software for model-based cluster analysis
• Role of normalization in spectral clustering for stochastic blockmodels
• Stochastic blockmodels with a growing number of classes
• RANDOM MATRICES: UNIVERSAL PROPERTIES OF EIGENVECTORS
• A nonparametric view of network models and Newman–Girvan and other modularities
• Graph limits and exchangeable random graphs
• The spectral radii and norms of large dimensional non-central random atrices matrices
• Latent Space Approaches to Social Network Analysis
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• The Largest Eigenvalue of Sparse Random Graphs
• A Survey of Statistical Network Models
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• A central limit theorem in the  -model for undirected random graphs with a diverging number of vertices
• Random Dot Product Graph Models for Social Networks
• The First Eigenvalue of Random Graphs

This page was built for publication: A limit theorem for scaled eigenvectors of random dot product graphs