Functional central limit theorem for subgraph counts in a dynamic random connection model
Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes, Moritz Otto·2025-11-22·via math.PR updates on arXiv.org
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.