Limit theorems for eigenvectors of the normalized Laplacian for random graphs

07/28/2016
by   Minh Tang, et al.
0

We prove a central limit theorem for the components of the eigenvectors corresponding to the d largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for stochastic blockmodel graphs, the rows of the spectral embedding of the normalized Laplacian converge to multivariate normals and furthermore the mean and the covariance matrix of each row are functions of the associated vertex's block membership. Together with prior results for the eigenvectors of the adjacency matrix, we then compare, via the Chernoff information between multivariate normal distributions, how the choice of embedding method impacts subsequent inference. We demonstrate that neither embedding method dominates with respect to the inference task of recovering the latent block assignments.

READ FULL TEXT
research
05/31/2013

A central limit theorem for scaled eigenvectors of random dot product graphs

We prove a central limit theorem for the components of the largest eigen...
research
10/10/2019

Efficient Estimation for Random Dot Product Graphs via a One-step Procedure

We propose a one-step procedure to efficiently estimate the latent posit...
research
09/29/2019

Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings

Graph embeddings, a class of dimensionality reduction techniques designe...
research
10/20/2019

Spectral bounds of the regularized normalized Laplacian for random geometric graphs

In this work, we study the spectrum of the regularized normalized Laplac...
research
09/28/2018

Weighted Spectral Embedding of Graphs

We present a novel spectral embedding of graphs that incorporates weight...
research
05/19/2022

Explainable Graph Theory-Based Identification of Meter-Transformer Mapping

Distributed energy resources are better for the environment but may caus...
research
08/10/2011

A consistent adjacency spectral embedding for stochastic blockmodel graphs

We present a method to estimate block membership of nodes in a random gr...

Please sign up or login with your details

Forgot password? Click here to reset