Functional central limit theorem for subgraph counts in a dynamic random connection model
Probability
2025-11-25 v1
Abstract
We prove a functional central limit theorem for subgraph counts in a dynamic version of the random connection model. To establish tightness, we develop a dynamic extension of the cumulant method.
Keywords
Cite
@article{arxiv.2511.18003,
title = {Functional central limit theorem for subgraph counts in a dynamic random connection model},
author = {Rajat Subhra Hazra and Nikolai Kriukov and Michel Mandjes and Moritz Otto},
journal= {arXiv preprint arXiv:2511.18003},
year = {2025}
}