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

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.