No CrossRef data available.
Published online by Cambridge University Press: 04 June 2025
In this paper we derive cumulant bounds for subgraph counts and power-weighted edge lengths in a class of spatial random networks known as weight-dependent random connection models. These bounds give rise to different probabilistic results, from which we mainly focus on moderate deviations of the respective statistics, but also show a concentration inequality and a normal approximation result. This involves dealing with long-range spatial correlations induced by the profile function and the weight distribution. We start by deriving the bounds for the classical case of a Poisson vertex set, and then provide extensions to α-determinantal processes.