Central limit theorem for linear eigenvalue statistics of random spatial networks

The random connection model provides a flexible framework for spatial networks in which connectivity is determined by both geometry and randomness. Its vertices form a Poisson point process, and pairs are connected independently, conditional on their positions, with distance-dependent probabilities. This generalizes the hard distance threshold of random geometric graphs and accommodates long-range connections. We also consider a weighted extension in which each vertex carries a positive random weight that influences its probability of connecting to other vertices. This combination of spatial structure and heterogeneous connectivity raises the question of whether spectral fluctuations exhibit Gaussian behavior on large scales. We address this question by studying linear eigenvalue statistics $\operatorname{Tr}[f(A_n)]$ of the adjacency matrix $A_n$ of the random connection model in expanding windows $W_n$. For polynomial test functions, we establish a finite limit for the normalized variance and prove a central limit theorem under suitable connection-profile integrability and vertex mark moment assumptions. When the limiting variance is positive, the normalized statistics admit an $O(|W_n|^{-1/2})$ normal-approximation bound in both Wasserstein and Kolmogorov distance. Furthermore, under an exponential moment assumption on the vertex marks, we extend the central limit theorem to a general class of test functions $f$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24128
Primary Topic
Random Matrices and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Central limit theorem for linear eigenvalue statistics of random spatial networks

Anne Marie Svane, Moritz Otto, Christian Hirsch, Kyeongsik Nam
arXiv (Cornell University)
Random Matrices and Applications
preprint

Central limit theorem for linear eigenvalue statistics of random spatial networks

Anne Marie Svane, Moritz Otto, Christian Hirsch, Kyeongsik Nam
preprint en

Abstract

The random connection model provides a flexible framework for spatial networks in which connectivity is determined by both geometry and randomness. Its vertices form a Poisson point process, and pairs are connected independently, conditional on their positions, with distance-dependent probabilities. This generalizes the hard distance threshold of random geometric graphs and accommodates long-range connections. We also consider a weighted extension in which each vertex carries a positive random weight that influences its probability of connecting to other vertices. This combination of spatial structure and heterogeneous connectivity raises the question of whether spectral fluctuations exhibit Gaussian behavior on large scales. We address this question by studying linear eigenvalue statistics $\operatorname{Tr}[f(A_n)]$ of the adjacency matrix $A_n$ of the random connection model in expanding windows $W_n$. For polynomial test functions, we establish a finite limit for the normalized variance and prove a central limit theorem under suitable connection-profile integrability and vertex mark moment assumptions. When the limiting variance is positive, the normalized statistics admit an $O(|W_n|^{-1/2})$ normal-approximation bound in both Wasserstein and Kolmogorov distance. Furthermore, under an exponential moment assumption on the vertex marks, we extend the central limit theorem to a general class of test functions $f$.

arXiv (Cornell University)
Random Matrices and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon