Functional central limit theorem for subgraph counts in a dynamic random connection model

2025/11/22 by Hazra, Rajat Subhra, Kriukov, Nikolai, Mandjes, Michel +1
Mathematics · #Stochastic processes and statistical mechanics #Random Matrices and Applications #Limits and Structures in Graph Theory

paper · doi:10.48550/arxiv.2511.18003

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.

Citations

• Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs
• Moderate deviations on Poisson chaos
• Normal approximation of subgraph counts in the random-connection model
• The large deviation principle for the Erdős-Rényi random graph

Related

• Normal approximation of subgraph counts in the random-connection model
• Graph connectivity with fixed endpoints in the random-connection model
• Random connection models in the thermodynamic regime: central limit theorems for add-one cost stabilizing functionals
• Functional Central Limit Theorem for Subgraph Counting Processes
• Functional limit theorems for edge counts in dynamic random connection hypergraphs