PreprintarXiv licencearXiv
Moderate deviations and laws of the iterated logarithm for geometric functionals in the sparse regime
Abstract
We prove moderate deviation principles and laws of the iterated logarithm in the sparse regime for geometric and topological functionals associated with k-point connected components. These limit theorems are established at both the measure-valued and vector-valued levels, for Poisson and binomial point processes. As applications, we derive corresponding results for component counts in random geometric graphs and Čech complexes and for counts of Morse critical points.
Related
- Law of the Iterated Logarithm for Weighted Sums of Functionals of Long-Memory Gaussian Sequences
- A geometric proof of multivariate self-normalized moderate deviations via ridge regularization
- Laws of the iterated logarithm for the range of once-reinforced random walk on ℤ
- A law of the iterated logarithm for random multiplicative functions on integers with a large prime factor
- Limit Laws of the Iterated Logarithm Under Sub-linear Expectations
BibTeX
@misc{sakihara2026moderate,
title = {{Moderate deviations and laws of the iterated logarithm for geometric functionals in the sparse regime}},
author = {Yudai Sakihara and Kenkichi Tsunoda},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.14923},
eprint = {2609.14923},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.14923},
}
RIS
TY - UNPB
TI - Moderate deviations and laws of the iterated logarithm for geometric functionals in the sparse regime
AU - Yudai Sakihara
AU - Kenkichi Tsunoda
PY - 2026
DA - 2026/09/14
PB - arXiv
DO - 10.48550/arxiv.2609.14923
UR - https://arxiv.org/abs/2609.14923
AB - We prove moderate deviation principles and laws of the iterated logarithm in the sparse regime for geometric and topological functionals associated with k-point connected components. These limit theorems are established at both the measure-valued and vector-valued levels, for Poisson and binomial point processes. As applications, we derive corresponding results for component counts in random geometric graphs and Čech complexes and for counts of Morse critical points.
ER -