Title: A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs

Author(s): A. Athreya, C. E. Priebe, M. Tang, V. Lyzinski, D. J. Marchette and D. L. Sussman
Issue: Volume 78 Series A Part 1 Year 2016
Pages: 1 -- 18
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. We use the spectral embedding of the adjacency matrix to construct consistent estimates for the latent positions, and we show that the appropriately scaled differences between the estimated and true latent positions converge to a mixture of Gaussian random variables. We state several corollaries, including an alternate proof of a central limit theorem for the first eigenvector of the adjacency matrix of an Erdős-Rényi random graph.
AMS (2000) subject classification. Primary 62E20; Secondary 05C80, 60F05.
Keywords and phrases: Random dot product graph, Central limit theorem, Model-based clustering.
View Article Download Article