Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 177 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 32 tok/s Pro
GPT-4o 119 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 432 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Spectral bounds of the regularized normalized Laplacian for random geometric graphs (1910.08873v1)

Published 20 Oct 2019 in math.SP and cs.DM

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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.