Limit theorems under heavy-tailed scenario in the age dependent random
connection models
Limit theorems under heavy-tailed scenario in the age dependent random
connection models
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable assumptions on the shape of trees. The proof relies on an intermediate result on weak convergence of …