Spectral bounds of the regularized normalized Laplacian for random geometric graphs

10/20/2019 ∙ by Mounia Hamidouche, et al. ∙ 0

In this work, we study the spectrum of the regularized normalized Laplacian for random geometric graphs (RGGs) in both the connectivity and thermodynamic regimes. We prove that the limiting eigenvalue distribution (LED) of the normalized Laplacian matrix for an RGG converges to the Dirac measure in one in the full range of the connectivity regime. In the thermodynamic regime, we propose an approximation for the LED and we provide a bound on the Levy distance between the approximation and the actual distribution. In particular, we show that the LED of the regularized normalized Laplacian matrix for an RGG can be approximated by the LED of the regularized normalized Laplacian for a deterministic geometric graph with nodes in a grid (DGG). Thereby, we obtain an explicit approximation of the eigenvalues in the thermodynamic regime.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.