Functional central limit theorem for subgraph counts in a dynamic random connection model
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917098521886720 |
|---|---|
| author | Hazra, Rajat Subhra Kriukov, Nikolai Mandjes, Michel Otto, Moritz |
| author_facet | Hazra, Rajat Subhra Kriukov, Nikolai Mandjes, Michel Otto, Moritz |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_18003 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Functional central limit theorem for subgraph counts in a dynamic random connection model Hazra, Rajat Subhra Kriukov, Nikolai Mandjes, Michel Otto, Moritz Probability 05C80, 60D05, 60G55 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. |
| title | Functional central limit theorem for subgraph counts in a dynamic random connection model |
| topic | Probability 05C80, 60D05, 60G55 |
| url | https://arxiv.org/abs/2511.18003 |