Paper
Central limit theorem for linear eigenvalue statistics of random geometric graphs
Authors
Christian Hirsch, Kyeongsik Nam, Moritz Otto
Abstract
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric graph, obtained by placing vertices according to a Poisson point process and connecting two vertices whenever their Euclidean distance is less than a certain threshold. Despite their broad applicability, the spectral properties of such spatial models remain far less understood than those of classical random graph models, such as Erdős-Rényi graphs and Wigner matrices. The main obstacle is the presence of spatial constraints, which induce highly nontrivial dependencies among edges, placing these models outside the scope of techniques developed for purely combinatorial random graphs. In this paper, we provide the first rigorous analysis of Gaussian fluctuations for linear eigenvalue statistics of random geometric graphs. Specifically, we establish central limit theorems for $\text{Tr}[φ(A)]$, where $A$ is the adjacency matrix and $φ$ ranges over a broad class of suitable (possibly non-polynomial) test functions. In the polynomial setting, we moreover obtain a quantitative central limit theorem, including an explicit convergence rate to the limiting Gaussian law. We further obtain polynomial-test-function CLTs for other canonical random spatial networks, including $k$-nearest neighbor graphs and relative neighborhood graphs. Our results open new avenues for the study of spectral fluctuations in spatially embedded random structures and underscore the delicate interplay between geometry, local dependence, and spectral behavior.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2602.17006v1</id>\n <title>Central limit theorem for linear eigenvalue statistics of random geometric graphs</title>\n <updated>2026-02-19T02:08:09Z</updated>\n <link href='https://arxiv.org/abs/2602.17006v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2602.17006v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric graph, obtained by placing vertices according to a Poisson point process and connecting two vertices whenever their Euclidean distance is less than a certain threshold. Despite their broad applicability, the spectral properties of such spatial models remain far less understood than those of classical random graph models, such as Erdős-Rényi graphs and Wigner matrices. The main obstacle is the presence of spatial constraints, which induce highly nontrivial dependencies among edges, placing these models outside the scope of techniques developed for purely combinatorial random graphs.\n In this paper, we provide the first rigorous analysis of Gaussian fluctuations for linear eigenvalue statistics of random geometric graphs. Specifically, we establish central limit theorems for $\\text{Tr}[φ(A)]$, where $A$ is the adjacency matrix and $φ$ ranges over a broad class of suitable (possibly non-polynomial) test functions. In the polynomial setting, we moreover obtain a quantitative central limit theorem, including an explicit convergence rate to the limiting Gaussian law. We further obtain polynomial-test-function CLTs for other canonical random spatial networks, including $k$-nearest neighbor graphs and relative neighborhood graphs. Our results open new avenues for the study of spectral fluctuations in spatially embedded random structures and underscore the delicate interplay between geometry, local dependence, and spectral behavior.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.PR'/>\n <published>2026-02-19T02:08:09Z</published>\n <arxiv:comment>27 pages, 2 figures</arxiv:comment>\n <arxiv:primary_category term='math.PR'/>\n <author>\n <name>Christian Hirsch</name>\n </author>\n <author>\n <name>Kyeongsik Nam</name>\n </author>\n <author>\n <name>Moritz Otto</name>\n </author>\n </entry>"
}