Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.08873 v1 pith:BZGR6C5F submitted 2019-10-20 math.SP cs.DM

Spectral bounds of the regularized normalized Laplacian for random geometric graphs

classification math.SP cs.DM
keywords laplaciannormalizedregularizedapproximationgeometricregimethermodynamicconnectivity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.