DeepAI AI Chat
Log In Sign Up

Eigenvalues and Spectral Dimension of Random Geometric Graphs in Thermodynamic Regime

by   Konstantin Avrachenkov, et al.

Network geometries are typically characterized by having a finite spectral dimension (SD), d_s that characterizes the return time distribution of a random walk on a graph. The main purpose of this work is to determine the SD of a variety of random graphs called random geometric graphs (RGGs) in the thermodynamic regime, in which the average vertex degree is constant. The spectral dimension depends on the eigenvalue density (ED) of the RGG normalized Laplacian in the neighborhood of the minimum eigenvalues. In fact, the behavior of the ED in such a neighborhood characterizes the random walk. Therefore, we first provide an analytical approximation for the eigenvalues of the regularized normalized Laplacian matrix of RGGs in the thermodynamic regime. Then, we show that the smallest non zero eigenvalue converges to zero in the large graph limit. Based on the analytical expression of the eigenvalues, we show that the eigenvalue distribution in a neighborhood of the minimum value follows a power-law tail. Using this result, we find that the SD of RGGs is approximated by the space dimension d in the thermodynamic regime.


page 1

page 2

page 3

page 4


Spectral bounds of the regularized normalized Laplacian for random geometric graphs

In this work, we study the spectrum of the regularized normalized Laplac...

Sherali--Adams Strikes Back

Let G be any n-vertex graph whose random walk matrix has its nontrivial ...

The Wigner's Semicircle Law of Weighted Random Networks

The spectral graph theory provides an algebraical approach to investigat...

Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix

We show that the multiplicity of the second normalized adjacency matrix ...

Spectral Edge in Sparse Random Graphs: Upper and Lower Tail Large Deviations

In this paper we consider the problem of estimating the joint upper and ...

Betweenness centrality in dense spatial networks

The betweenness centrality (BC) is an important quantity for understandi...

Explainable Graph Theory-Based Identification of Meter-Transformer Mapping

Distributed energy resources are better for the environment but may caus...