  In this paper, we derive cumulant bounds for subgraph counts and
power-weighted edge length in a class of spatial random networks known as
weighted random connection models. 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 $\alpha$-determinantal
processes.
