Hostname: page-component-74656f9884-6grmk Total loading time: 0 Render date: 2026-11-05T05:05:04.267Z Has data issue: false hasContentIssue false

Normal approximation for subgraph counts in age-dependent random connection models

Published online by Cambridge University Press:  08 September 2026

Christian Hirsch*
Affiliation:
Aarhus University
Raphaël Lachièze-Rey*
Affiliation:
Inria, and Lab. MAP5, Université Paris Cité
Takashi Owada*
Affiliation:
Purdue University
*
*Postal address: Department of Mathematics, Aarhus University, Aarhus, Denmark. Email: hirsch@math.au.dk
**Postal address: Inria Paris Centre, Paris, France. Email: raphael.lachieze-rey@math.cnrs.fr
***Postal address: Department of Statistics, Purdue University, West Lafayette, USA. Email: owada@purdue.edu
Rights & Permissions [Opens in a new window]

Abstract

We study normal approximation of subgraph counts in a model of spatial scale-free random networks known as the age-dependent random connection model. In the light-tailed regime where only moments of order $(2+\varepsilon)$ are finite, we study the asymptotic normality of both clique and subtree counts. For clique counts, we establish a multivariate quantitative normal approximation result through the Malliavin–Stein method. In the more delicate case of subtree counts, we obtain distributional convergence based on a central limit theorem for sequences of associated random variables.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. Example of directed wedge trees of two leaves (i.e. ℓ=2$\ell=2$), where two vertices are connected to a root with a lower mark. The quantity Tn,T$\mathcal T_{n,\mathsf{T}}$ counts only the ‘visualized’ rooted wedges drawn by solid lines. Note that each such rooted wedge admits two isomorphisms, and therefore we have Tn,T=14$\mathcal T_{n,\mathsf{T}} = 14$.