A

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

arXiv (Cornell University)

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.

Authors 1

  1. Leiden University

    Affiliation as printed

    with Mathematical Institute , Leiden University , The Netherlands

Cited by 0 stored of 0

References 0