1. Introduction
In the random geometric graph, the vertex set is a random set of points in Euclidean space, and any two vertices are connected by an edge if their distance is smaller than a fixed threshold. Such a random geometric graph is a model in a wide variety of applications such as wireless networks. Therefore its asymptotic behavior for a large number of nodes has been studied extensively in the literature [Reference Penrose16]. However, with the rise of network science, it has become apparent that often this model is not flexible enough to capture more complex structures. Driven by this need, the class of weight-dependent random connection models (WRCMs) has recently appeared as a promising approach for describing phenomena in large complex networks [Reference Gracar, Grauer, Lüchtrath and Mörters7, Reference Gracar, Heydenreich, Mönch and Mörters8, Reference Komjáthy and Lodewijks13]. Instead of a fixed connection threshold, the WRCMs quantify the connectivity via a profile function and a weight distribution. However, due to the complexity of the models, the analysis of their asymptotic behavior is still in its infancy. In this paper we study the question of asymptotic normality of suitable functionals on the WRCM. This is relevant in order to put the analysis of data via WRCMs on a firm statistical foundation.
One of the main tools in the analysis of asymptotic normality is the method of cumulants [Reference Döring, Jansen and Schubert3, Reference Saulis and Statulevičius19]. Its popularity stems from the level of generality where it is applicable and the variety of implications it draws. Moreover, one obtains specific non-asymptotic bounds for the rate of convergence to the normal distribution. However, the challenge in applying the method of cumulants is that it requires the computation of higher-order integrals of the functional under consideration. This is particularly challenging in settings involving long-range spatial correlations. Important progress was recently achieved by Liu and Privault [Reference Liu and Privault15] and Schulte and Thäle [Reference Schulte and Thäle20], who derived a general formula for the cumulants of U-statistics based on Poisson processes; see e.g. [Reference Schulte and Thäle20, Theorem 3.2]. This formula relies on the computation of higher-order integrals, which are particularly accessible for random geometric graphs, where the corresponding integrands are bounded and of bounded support. This is no longer true in the WRCM where the range of the support depends on the profile function and the weight distribution.
While Poisson processes are certainly the simplest model for a random point pattern in Euclidean space, they are inappropriate in settings with substantial spatial correlations. In order to overcome this limitation, one considers determinantal and permanental point processes that are based on a spatial kernel function [Reference Hough, Krishnapur, Peres and Virág11]. These classes of point processes are particularly well-suited to cumulant-based methods since their cumulant density can be expressed in closed form in terms of the kernel function [Reference Heinrich9]. Recently, asymptotic normality for U-statistics of determinantal point processes associated with spectral projection kernels on the unit sphere has been obtained in [Reference Feng, Götze and Yao5]. One of the key observations in [Reference Heinrich and Klein10] and [Reference Jolivet12] is that the cumulants of U-statistics can again be bounded in terms of higher-order integrals. These integrals are reminiscent of those appearing in [Reference Schulte and Thäle20, Theorem 3.2] but are more complex due to the presence of the kernel function. We show that the results in the Poisson case can be extended to this more complex setting at the cost of weaker bounds on the convergence rate. In this context we provide a lower bound on the variance of the functional under consideration, which may be of independent interest.
The main contributions of this paper are as follows.
-
(i) Show asymptotic normality for power-weighted edge lengths and subgraph counts in the WRCM. One of the key achievements of our result is that our bounds are completely transparent in the moment assumptions on the weight distribution and the profile function.
-
(ii) While [Reference Schulte and Thäle20] focuses on the case of Poisson processes, we extend the results to
$\alpha$
-determinantal processes. This relies on expansions derived in [Reference Heinrich9], [Reference Heinrich and Klein10], and [Reference Jolivet12]. -
(iii) Explain how variance lower bounds can be established for the considered functionals.
The rest of the manuscript is organized as follows. In Section 2 we introduce the model and state our main results. Then we discuss certain preliminary results concerning general cumulant computations in Section 5. Sections 6, 7, and 8 contain the proofs of the main results. Finally, Section 4 contains some considerations regarding the lower variance bounds.
2. Model and main results
The main goal of this work is to establish moderate deviations in the setting of WRCM. To do so, we will rely on the so-called method of cumulants (see Section 5.2 below for more details). One of the core strengths of this method is that it gives rise not only to moderate deviations but to a variety of different limit results as elaborated in [Reference Döring, Jansen and Schubert3], and [Reference Saulis and Statulevičius19]. To make our presentation self-contained, we reproduce these consequences here.
Let
$(X_n)_{n \geq 1}$
be a sequence of square-integrable random variables, let
$\gamma \geq0$
be a constant, and let
$(\Delta_n)_{n \geq 1}$
be a positive real-valued sequence. We say that
$(X_n)_{n \geq 1}$
satisfies the following.
-
•
$\operatorname{\bf MDP} (\gamma, (\Delta_n)_{n \geq 1})$
if for any positive real-valued sequence
$(a_n)_{n \geq 1}$
with the rescaled random variables
\[\lim_{n \to \infty} a_n=\infty \quad \text{and} \quad \lim_{n \to \infty} \dfrac{a_n}{\Delta_n^{1/(1+2\gamma)}}=0\]
satisfy a moderate deviation principle (MDP) with speed
\[(\widehat X_n)_{n \geq 1} \,: =\, (a_n^{-1}(X_n-\mathbb{E}[X_n])/\sqrt{\operatorname{Var}(X_n)})_{n \geq 1}\]
$a_n^2$
and good rate function
$\mathcal I(z)=z^2/2$
. That is, for all Borel sets A, where
\begin{align*}- \inf_{z \in \text{int}(A)} \mathcal I(z) &\leq \liminf_{n \to \infty} a_n^{-2} \log \mathbb{P}(\widehat X_n \in A)\\&\leq \limsup_{n \to \infty} a_n^{-2} \log \mathbb{P}(\widehat X_n \in A) \\&\leq -\inf_{z \in \text{cl}(A)} \mathcal I(z),\end{align*}
$\text{int}(A)$
and
$\text{cl}(A)$
, respectively, stand for the interior and the closure of A [Reference Dembo and Zeitouni2]. This might look quite familiar to a large deviation principle. However, since in our setting the speed
$a_n$
is of order smaller than
$\sqrt{\operatorname{Var} (X_n)}$
, the term MDP is more appropriate.
-
•
$\operatorname{\bf CI} (\gamma, (\Delta_n)_{n \geq 1})$
if the Bernstein-type concentration inequality holds for all
\[\mathbb{P}\bigl( |X_n-\mathbb{E}[X_n]|\geq z \sqrt{\operatorname{Var} (X_n)} \bigr) \leq 2 \exp \biggl( -\dfrac 14 \min\biggl\{ \dfrac{z^2}{2^{1+\gamma}},(z\Delta_n)^{1/(1+\gamma)} \biggr\} \biggr)\]
$n \geq 1$
and
$z \geq 0$
,
-
•
$\operatorname{\bf NACC} (\gamma, (\Delta_n)_{n \geq 1})$
if a normal approximation bound with Crámer correction holds, that is, if there exist constants
$c_0,c_1,c_2>0$
only depending on
$\gamma$
such that, for all
$n \geq 1$
and
$z \in \bigl[0,c_0\Delta_n^{1/(1+2\gamma)}\bigr]$
, and
\[\mathbb{P}\bigl( |X_n-\mathbb{E}[X_n]|\geq z \sqrt{\operatorname{Var} (X_n)} \bigr) = {\textrm{e}}^{L_{n,z}^+}(1-\Phi(z))\biggl(1+c_1\theta_{n,z}^+ \dfrac{1+z}{\Delta_n^{1/(1+2\gamma)}}\biggr)\]
with
\[\mathbb{P}\bigl( |X_n-\mathbb{E}[X_n]|\leq -z \sqrt{\operatorname{Var} (X_n)} \bigr) = {\textrm{e}}^{L_{n,z}^-}(1-\Phi(z))\biggl(1+c_1\theta_{n,z}^- \dfrac{1+z}{\Delta_n^{1/(1+2\gamma)}}\biggr)\]
$\theta_{n,z}^+, \theta_{n,z}^-\in [{-}1,1]$
and where
\[L_{n,z}^+,L_{n,z}^-\in \bigl(-c_2z^3/\Delta_n^{1/(1+2\gamma)},c_2z^3/\Delta_n^{1/(1+2\gamma)}\bigr),\]
$\Phi$
is the distribution function of a standard normal random variable.
We now provide a formal definition of the WRCM considered in this paper; see [Reference Gracar, Grauer, Lüchtrath and Mörters7], [Reference Gracar, Heydenreich, Mönch and Mörters8], and [Reference Komjáthy and Lodewijks13]. Let
$ \mathcal P_n \,: =\, \{P_i\}_{i \geq 1} \,: =\, \{(X_i, U_i)\}_{i \geq 1}$
be a Poisson point process on the space
$W \times [0,\infty)$
with intensity measure
$t_n {\textrm{d}} x \otimes \mathbb{P}_U({\textrm{d}} u)$
for some compact set
$W \subseteq \mathbb{R}^d$
with non-empty interior, some
$t_n >0$
, and
$\mathbb{P}_U$
is a probability distribution. Then, in the WRCM, between any pair of points
$P_i, P_j$
we place an edge independently with probability
where we now explain the individual components in detail.
-
(i)
$\varphi\colon [0,\infty) \to [0, 1]$
is the profile function, which is non-increasing and for which we assume the normalization
$\int \varphi(t) \,{\textrm{d}} t = 1$
. -
(ii)
$|B_{\|X_i-X_j\|}|$
is the volume of the Euclidean ball of radius
$\|X_i-X_j\|$
in
$\mathbb{R}^d$
. In the literature, the scaling
$\|X_i - X_j\|^d$
is sometimes used. Since the difference is only in a constant multiple, the two parameterizations are equivalent. For our analysis, the parameterization with the ball-based scaling will substantially simplify the statements and proofs of our main results. -
(iii)
$(\nu_n)_{n \geq 1}$
is a positive real-valued sequence that is bounded from above. It can be thought of as the volume of a ball around a typical node within which most neighbors of this node are located. -
(iv) Finally,
$\kappa\colon [0,\infty) \times [0,\infty) \to [0,\infty)$
is the interaction kernel, which is non-decreasing in both arguments. We assume that
$\kappa$
is such that
$1\leq\kappa(u,v) \leq uv$
for all
$u,v \geq 0$
.
In a broad sense, our cumulant bounds are similar to those considered earlier in the setting of standard random geometric graphs [Reference Schulte and Thäle20]. However, in the setting of WRCM the convergence will depend sensitively on moment estimates for both the profile function and the weight distribution. To make this precise, we now introduce specific conditions on these quantities.
We assume that
$ U \geq 1 $
a.s. and that there are constants
$c_{U, 1}>0$
and
$c_{U, 2}\leq 1$
such that for all
$x\geq1$
,
where
is the standard Gamma function. For instance, if X is exponentially distributed with some parameter
$\lambda>0$
, then
$U\,: =\, X+1$
satisfies (MU) with
$c_{U, 2}=1$
. Moreover, if X is a standard normal random variable and
$U \sim X \mid \{X>1\}$
, then (MU) holds with
$c_{U, 2}=1/2$
. As we will see in Theorem 2.1 below, the value of the constant
$c_{U, 2}$
is much more important than that of
$c_{U, 1}$
.
The first functional of interest is the subgraph count, which was also considered in [Reference Schulte and Thäle20], and we recall the definition here. Let G be a fixed connected graph on the vertices
$\{1, \ldots, q\}$
. Then we let
$S_n(G)$
denote
$1/q!$
times the number of q-tuples
$(P_1, \ldots, P_q) \in \mathcal P_n^q$
such that for every edge
$\{i, j\}$
in G, the WRCM has an edge between
$P_i$
and
$P_j$
.
Theorem 2.1. (Cumulant bounds for subgraph count.) Let
$ d\geq 1$
and G be a fixed connected graph on q vertices. Assume that
$U \geq 1$
a.s. and that condition (MU) holds, and set
$A_{\textrm{SG}} \,: =\, (q-1)(1+c_{U, 2})$
. Moreover, assume that there exists
$v > 0$
such that for all
$n \geq1$
,
Then
$S_n(G)$
satisfies
$\operatorname{\bf MDP}(A_{\textrm{SG}},(\beta_n)_n)$
,
$\operatorname{\bf CI} (A_{\textrm{SG}},(\beta_n)_n)$
, and
$\operatorname{\bf NACC} (A_{\textrm{SG}},(\beta_n)_n)$
with
Second, for fixed
$\tau \geq 0$
, we consider the
$\tau$
-power-weighted edge length given by
where
$P_i \sim P_j$
indicates the existence of an edge in the WRCM. Here we additionally need to impose similar assumptions concerning
$\varphi$
as we did for the weights in (MU). More precisely, we assume that there are constants
$c_{\varphi, 1}>0$
and
$c_{\varphi, 2}\leq 1$
such that for all
$x\geq0$
,
\begin{align}M_{\varphi}(x)&\,: =\, \int_0^\infty \varphi(t) t^{x } \, {\textrm{d}} t \leq c_{\varphi, 1}^{x} \Gamma(1+ x)^{c_{\varphi, 2}}\quad\text{and}\quad\nonumber\\ M_{\varphi}'(x)&\,: =\, \text{sup}_{t>0}\, \varphi(t) t^{x}\leq c_{\varphi, 1}^x \Gamma(1+ x)^{c_{\varphi, 2}}.\end{align}
For instance, (MPHI) holds if
$\varphi$
has compact support. Moreover, similarly as for the case of weights, one can also consider the cases of exponential tails where
$c_{\varphi, 2} = 1$
and Gaussian tails where
$c_{\varphi, 2} = 1/2$
.
Theorem 2.2. (Cumulant bounds for power-weighted edge lengths.) Let
$ d\geq 1$
and
$\tau \geq 0$
. Assume that
$U \geq 1$
a.s. and that conditions (MU) and (MPHI) hold, and set
$A_{\textrm{EL}} \,: =\, 1 + 2c_{U, 2}(\tau_d + 1) + c_{\varphi, 2}\tau_d$
, where
$\tau_d \,: =\, \tau/d$
. Moreover, assume that there exists
$v > 0$
such that for all
$n \geq1$
,
Then the power-weighted edge length
$S_n^{(\tau)}$
satisfies
$\operatorname{\bf MDP} (A_{\textrm{EL}},(\beta_n)_n)$
,
$\operatorname{\bf CI} (A_{\textrm{EL}},(\beta_n)_n)$
, and
$\operatorname{\bf NACC} (A_{\textrm{EL}},(\beta_n)_n)$
with
for
$n \geq 1$
.
Note that for
$U=1$
a.s. and
$\varphi( \cdot )=\mathbf{1}_{[0,1]}$
, the weight-dependent random connection model reduces to the classical random geometric graph. In this situation, [Reference Schulte and Thäle20, Section 4.2] establishes the analogue of Theorem 2.1. Since we can choose
$a=c_{U, 1}=1$
,
$c_{U, 2}=0$
in this case, Theorem 2.1 generalizes [Reference Schulte and Thäle20, Corollary 4.2] to the weight-dependent situation.
We also note that for many real-world datasets one can encounter the setting where the weights only have a finite number of moments. In such situations our results do not apply since the condition (MU) is violated.
Finally, in Theorems 2.3 and 2.4 below, we replace the Poisson point process with an
$\alpha$
-determinantal point process (
$\alpha$
-DPP) as input. We note that while a homogeneous Poisson point process is a special case of an
$\alpha$
-DPP, the convergence rates derived for
$\alpha$
-DPPs are less sharp than that for Poisson input. Hence the results in Theorems 2.3 and 2.4 do not supersede those in Theorems 2.1 and 2.2.
Recall that for
$\alpha\in \mathbb{R}$
a simple point process is called
$\alpha$
-determinantal point process (
$\alpha$
-DPP) with covariance kernel
$K\colon \mathbb{R}^d \times \mathbb{R}^d \to \mathbb{C}$
if, for all
$k \geq 1$
, its kth product density
$\rho_k$
is given by
\begin{align}\rho_k(x_1,\ldots,x_k)=\sum_{\pi \in \operatorname{Per}(k)} \alpha^{k-n(\pi)} \prod_{i=1}^k K(x_i,x_{\pi(i)}) \end{align}
for all
$x_1,\ldots,x_k \in \mathbb{R}^d$
, where
$\operatorname{Per} (k)$
is the set of all permutations of
$\{1,\ldots,k\}$
and
$n(\pi)$
is the number of cycles in the permutation
$\pi$
. Important special cases are determinantal processes (
$\alpha=-1$
) and permanental processes (
$\alpha=1$
). Following [Reference Heinrich9, Section 3], we assume throughout that the kernel is stationary, i.e.
$K(x,y)=K(o,y-x)=K_0(y-x)$
for all
$x,y \in \mathbb{R}^d$
, where
$K_0(x)$
is a continuous, complex-valued, positive semi-definite function, i.e.
$\sum_{i,j=1}^n z_i K_0(x_i-x_j) \overline{z_j}\geq 0$
for all
$x_1,\ldots,x_n \in \mathbb{R}^d,\,z_1,\ldots,z_n \in \mathbb{C}$
. This implies that
$K_0(o)\geq 0$
,
$K_0(-x)=\overline{K_0(x)}$
,
$|K_0(x)|\leq K_0(o)$
for all
$x \in \mathbb{R}^d$
and that the
$\alpha$
-DPP with kernel K is stationary. Moreover, we assume that
Under these assumptions, it is shown in [Reference Heinrich9, Theorem 2] that the
$\alpha$
-DPP with kernel K is Brillinger-mixing, which says that for all
$k \geq 1$
, its kth cumulant density is absolutely integrable.
Since there is no natural analogue to an increasing intensity parameter for
$\alpha$
-DPPs, we will instead consider the scenario of an independent
$\mathbb{P}_U$
-marking
$ \mathcal P$
of an
$\alpha$
-DPP on
$W_n\,: =\, n^{1/d}W$
. This is as in [Reference Yogeshwaran and Adler23]. Note that due to the scaling invariance property of a Poisson process, Theorems 2.1 and 2.2 could also be formulated in this setup.
Theorem 2.3. (Cumulant bounds for subgraph count for
$\alpha$
-DPPs.) Let
$ d\geq 1$
and let
$ \mathcal P$
be an independent
$\mathbb{P}_U$
-marking of an
$\alpha$
-DPP for some
$\alpha \in [{-}1,1]$
. Assume that the stationary covariance kernel K satisfies the conditions (DPP). Let G be a fixed connected graph with q vertices and consider the subgraph count
$S_n(G)$
. Assume that
$U \geq 1$
a.s. and that condition (MU) holds and set
$A_{\textrm{SG}'} \,: =\, 2q+(q-1)c_{U, 2}-1$
. Moreover, assume that there exists
$v > 0$
such that for all
$n \geq1$
,
Then
$S_n(G)$
satisfies
$\operatorname{\bf MDP} (A_{\textrm{SG}'},(\beta_n)_n)$
,
$\operatorname{\bf CI} (A_{\textrm{SG}'},(\beta_n)_n)$
, and
$\operatorname{\bf NACC} (A_{\textrm{SG}'},(\beta_n)_n)$
with
with
$b_{\textrm{SG}}$
from Theorem 2.1.
The next result is the analogue of Theorem 2.2 for
$\alpha$
-determinantal input.
Theorem 2.4. (Cumulant bounds for power-weighted edge lengths for
$\alpha$
-DPPs.) Let
$ d\geq 1$
and let
$ \mathcal P$
be an independent
$\mathbb{P}_U$
-marking of an
$\alpha$
-DPP for some
$\alpha \in [{-}1,1]$
. Assume that the stationary covariance kernel K satisfies the conditions (DPP). Consider the
$\tau$
-power-weighted edge length
$S_n^{(\tau)}$
. Assume that
$U \geq 1$
a.s. and that conditions (MU) and (MPHI) hold, and set
$A_{\textrm{EL}'} \,: =\, 3+c_{\varphi, 2} \tau_d+2c_{U, 2} (\tau_d+1)$
, where
$\tau_d\,: =\, \tau/d$
. Moreover, assume that there exists
$v > 0$
such that for all
$n \geq1$
,
Then the power-weighted edge lengths
$S_n^{(\tau)}$
satisfy
$\operatorname{\bf MDP} (A_{\textrm{EL}'},(\beta_n)_n)$
,
$\operatorname{\bf CI} (A_{\textrm{EL}'},(\beta_n)_n)$
, and
$\operatorname{\bf NACC} (A_{\textrm{EL}'},(\beta_n)_n)$
with
with
$b_{\textrm{EL}}$
from Theorem 2.2.
Remark 2.1. We stress that the existence of an
$\alpha$
-DPP with a given covariance kernel K is not guaranteed. Hence we say that some
$\alpha\in \mathbb{R}$
is admissible if there exists a point process whose k product intensity is given by (2.1). By [Reference Shirai and Takahashi21, Theorem 1.2], it is known that all
$\alpha\in \{\pm 1/m\colon m \in \mathbb{N}\}$
are admissible.
Remark 2.2. In Propositions 4.1 and 4.3 below we show that the variance lower bounds assumed in Theorems 2.1 and 2.2 hold for an appropriate sequence
$(\nu_n)_{n \geq 1}$
and give a possible choice for the constant
$v>0$
. Note that variance lower bounds are also required in Theorems 2.3 and 2.4 for
$\tau \geq 0$
. Here, due to the different scenario of an increasing sampling window, we rather work with a sequence where
$(\nu_n/n)_{n \geq 1}$
is bounded. In Remark 4.1 we address the problem of obtaining variance lower bounds for U-statistics of
$\alpha$
-determinantal processes if
$\alpha <0$
. It is interesting that for U-statistics of determinantal point processes associated with spectral projection kernels, the symmetry of the sphere can be used to derive explicit variance asymptotics (see [Reference Feng, Götze and Yao5, Theorem 3]).
Remark 2.3. Our techniques also allow us to obtain Berry–Esseen bounds for
$S_n(G)$
and
$S_n^{(\tau)}$
. For details we refer to [Reference Döring, Jansen and Schubert3, Theorem 2.4].
3. Applications
In this section we explain how our results apply to well-known random geometric graphs and make the constants in the theorems above more explicit. In the following, let
$W \subset \mathbb{R}^d$
be a compact set with non-empty interior.
Example 1. (Total edge length in the Gilbert graph.) For
$\kappa \equiv 1$
and
$\varphi( \cdot )\,: =\, \mathbf{1}\{\cdot \leq 1\}$
our model reduces to the Gilbert graph, in which two points
$X_i$
and
$X_j$
are connected whenever their Euclidean distance is at most
$(\nu_n/\kappa_d)^{1/d}$
. Then (MU) and (MPHI) are satisfied with
$c_{U,1}=c_{\varphi,1}=1$
and
$c_{U,2}=c_{\varphi,2}=0$
. Let
$\tau\,: =\, 1$
. Then
$S_n^{(1)}$
is the total edge length in the random geometric graph built on the point process
$ \mathcal P$
. From Proposition 4.1 below it follows that conditions (VEL) and (VEL′
) hold for some
$v>0$
(see Remark 2.2).
If
$ \mathcal P$
is a Poisson process with intensity measure
$t_n {\textrm{d}} x \otimes \mathbb{P}_U({\textrm{d}} u)$
on
$W \times [1,\infty)$
, Theorem 2.2 gives
$\operatorname{\bf MDP} / \operatorname{\bf CI} / \operatorname{\bf NACC} (1,(\beta_n)_n)$
with
Next, let
$ \mathcal P$
be an independent
$\mathbb{P}_U$
-marking of an
$\alpha$
-DPP with
$\alpha \in [0,1]$
on
$n^{1/d}W \times [1,\infty)$
, where the stationary covariance kernel satisfies condition (DPP). Then Theorem 2.4 yields
$\operatorname{\bf MDP} / \operatorname{\bf CI} / \operatorname{\bf NACC} (3,(\beta_n)_n)$
with
Example 3.2. (Triangle count in the Boolean model.) Let
$\kappa(U_i,U_j)=(U_i^{1/d}+U_j^{1/d})^d$
and
$\varphi( \cdot )\,: =\, \mathbf{1}\{\cdot \leq 1\}$
. Then we are in the situation of a Boolean model, where
$X_i$
and
$X_j$
are connected if the balls with volumes
$\nu_n U_i$
and
$\nu_n U_j$
centered at
$X_i$
and
$X_j$
, respectively, have non-empty intersection. Let
$\lambda>0$
and assume that
$\mathbb{P}_U$
has the probability density
$\lambda {\textrm{e}}^{-\lambda(u-2)} \mathbf{1}_{[2,\infty)}(u)$
. Then assumption (MU) holds with
$c_{U,1}=\lambda {\textrm{e}}^{2\lambda}$
and
$c_{U,2}=1$
. From Proposition 4.3 it follows that conditions (VSG) and (VSG′
) are satisfied for some
$v>0$
.
If
$ \mathcal P$
is a Poisson process with intensity measure
$t_n {\textrm{d}} x \otimes \mathbb{P}_U({\textrm{d}} u)$
on
$W \times [1,\infty)$
, Theorem 2.1 gives
$\operatorname{\bf MDP} /\operatorname{\bf CI} /\operatorname{\bf NACC} (4,(\beta_n)_n)$
with
Next, assume that
$ \mathcal P$
is an independent
$\mathbb{P}_U$
-marking of an
$\alpha$
-DPP with
$\alpha \in [0,1]$
on
$n^{1/d}W \times [1,\infty)$
, where the stationary covariance kernel satisfies condition (DPP). Then Theorem 2.3 yields
$\operatorname{\bf MDP} /\operatorname{\bf CI} /\operatorname{\bf NACC} (7,(\beta_n)_n)$
with
4. Variance lower bounds
All of our main results depend on lower bounds for the variance of
$S_n(G)$
and
$S_n^{(\tau)}$
, respectively. Before proving our results in the upcoming sections, we elaborate on how these lower bounds can be established. Although the following propositions are stated for the scenario of a fixed point process restricted to a growing sampling window
$W_n$
, they hold analogously in the case of a Poisson process with a growing intensity
$t_n$
on a fixed sampling window W.
For some
$a>0$
, let
be the set of all
$x \in W_n$
such that a ball centered at x with volume a is still contained entirely in
$W_n$
.
We start with the lower bound on
$\operatorname{Var} (S_n^{(\tau d)})$
.
Proposition 4.1. (Variance lower bounds for power-weighted edge count.) For
$\alpha \in [0,1]$
, let
$ \mathcal P$
be a stationary
$\alpha$
-DPP. Let
$\varepsilon > 0$
and
$\tau \geq 0$
. Then, for
$n \geq 1$
,
where
Note that if the sequence
$(\nu_n/n)_{n \geq 1}$
is bounded, we have
$v>0$
. Indeed, our assumptions (that
$\int_0^\infty \varphi(t) \,{\textrm{d}} t=1$
and that
$\varphi$
is non-increasing) guarantee that there exists some
$\varepsilon>0$
such that
$\varphi(\varepsilon)>0$
and
Proposition 4.2. (Proof of Proposition 4.1.) Given an
$\alpha$
-DPP
$ \mathcal P$
, recall that its kth product density
$\rho_k$
is given as in (2.1). Then, expanding the second moment of
$S_n^{(\tau d)}$
into three terms, we find that the variance of
$S_n^{(\tau d)}$
is given by
\begin{align*}|B_1|^{2\tau}\operatorname{Var} (S_n^{(\tau d)}) &=|B_1|^{2\tau}\bigl(\mathbb{E}\bigl[\bigl(S_n^{(\tau d)}\bigr)^2\bigr] - \mathbb{E}\bigl[S_n^{(\tau d)}\bigr]^2 \bigr)\\& = \int_{W_n^2} |B_{\|x-y\|}|^{2\tau}\mathbb{E}[\varphi_n(x - y, U, V)] \rho_2(x,y) \,{\textrm{d}} (x,y)\\&\quad +2\int_{W_n^3} |B_{\|x-y\|}|^{\tau} |B_{\|x-y'\|}|^{\tau} \mathbb{E}[\varphi_n(x - y, U, V)\varphi_n(x - y', U, V')] \\&\qquad \times \rho_3(x,y,y') \,{\textrm{d}} (x,y,y')\\&\quad + \int_{W_n^4} |B_{\|x-y\|}|^{\tau} |B_{\|x'-y'\|}|^{\tau} \mathbb{E}[\varphi_n(x - y, U, V)\varphi_n(x'-y',U',V')]\\&\qquad \times \rho_4(x,x',y,y')) \,{\textrm{d}} (x,y,x',y')\\&\quad - \int_{W_n^4} |B_{\|x-y\|}|^{\tau} |B_{\|x'-y'\|}|^{\tau} \mathbb{E}[\varphi_n(x - y, U, V)\varphi_n(x' - y', U', V')]\\&\qquad \times \rho_2(x,y)\rho_2(x',y') \,{\textrm{d}} (x,y,x',y'),\end{align*}
where
$U, U',V, V' \sim \mathbb{P}_U$
are independent. Since for an
$\alpha$
-DPP with
$\alpha \geq0$
all terms on the right-hand side in (2.1) are non-negative, we have
$\rho_{4}(x,x',y,y')\geq \rho_2(x,y) \rho_2(x',y')$
for all
$x,x',y,y' \in \mathbb{R}^{d}$
. Therefore,
\begin{align*}|B_1|^{2\tau}\operatorname{Var} (S_n^{(\tau d)}) &\geq \int_{W_n^2} |B_{\|x-y\|}|^{2\tau}\mathbb{E}[\varphi_n(x - y, U, V)] \rho_2(x,y)\,{\textrm{d}} (x,y)\\&\quad+2\int_{W_n^3} |B_{\|x-y\|}|^{\tau} |B_{\|x-y'\|}|^{\tau} \mathbb{E}[\varphi_n(x - y, U, V)\varphi_n(x - y', U, V')]\\&\qquad \times \rho_3(x,y,y')\,{\textrm{d}} (x,y,y').\end{align*}
We now give lower bounds for the two terms separately, starting with the first one. We use spherical coordinates and exploit that
$\kappa(u,v)\geq 1$
. Since
$\rho_2(x,y)\geq K_0(o)^2$
for all
$x,y \in \mathbb{R}^d$
, this gives
Similarly, for the second integral we obtain the lower bound
Hence combining the two bounds yields the assertion.
Next we consider the variance of the subgraph count
$S_n(G)$
.
Proposition 4.3. (Variance lower bounds for the subgraph count.) For
$\alpha \in [0,1]$
, let
$ \mathcal P$
be a stationary
$\alpha$
-DPP, and let G be a fixed connected graph on q vertices. Let
$\varepsilon>0$
. Then, for
$n \geq 1$
,
where
Proof. Let G be a fixed connected graph on vertices
$1,\ldots,q$
. For
$s_i \in \mathbb{X}\,: =\, W \times [1,\infty)\times [0,1]^{\mathbb{N}}$
,
$i=1,\ldots,q,$
let
$f_n(s_1,\ldots,s_q)$
be
$1/q!$
times the number of subgraphs in the WRCM built on these points that are isomorphic to G (see the proof of Theorem 2.1). Moreover, for
$k \in \mathbb{N}$
, let
$\rho_\ell$
be the kth product density of
$ \mathcal P$
. Then we have
\begin{align}\operatorname{Var} (S_n(G)) &= \sum_{k=0}^{q} \binom qk \int_{\mathbb{X}^q} \int_{\mathbb{X}^k} f_n(\mathbf{s}) f_n(\mathbf{s}_{q-k},\mathbf{t}) \rho_{q+k}(\mathbf{x},\mathbf{y}) \mu_n^k({\textrm{d}} \mathbf{t}) \mu_n^q({\textrm{d}} \mathbf{s}) \nonumber\\&\quad- \int_{\mathbb{X}^q} \int_{\mathbb{X}^q} f_n(\mathbf{s}) f_n(\mathbf{t}) \rho_q(\mathbf{x})\rho_q(\mathbf{y}) \mu_n^q({\textrm{d}} \mathbf{t}) \mu_n^q({\textrm{d}} \mathbf{s}),\end{align}
where
$\mathbf{s}\,: =\, (s_1,\ldots,s_q)$
and
$x_i$
is the first coordinate of
$s_i$
for
$i=1,\ldots,q$
, and
$\mathbf{s}_{q-k}\,: =\, (s_1,\ldots,s_{q-k})$
(similarly for
$\mathbf{t}$
and
$\mathbf{y}$
). Accordingly, we formally put
$f_n(\mathbf{s}_0,\mathbf{t})=f_n(\mathbf{t})$
. Since for
$\alpha>0$
all terms on the right-hand side in (2.1) are non-negative, it holds that
$\rho_{2q}(\mathbf{x},\mathbf{y})\geq \rho_q(\mathbf{x}) \rho_q(\mathbf{y})$
for all
$\mathbf{x} \in \mathbb{R}^{qd}$
,
$\mathbf{y} \in \mathbb{R}^{qd}$
. This yields
\begin{align}\operatorname{Var} (S_n(G)) \geq \sum_{k=0}^{q-1} \ \binom qk \int_{\mathbb{X} ^q} \int_{\mathbb{X} ^k} f_n(\mathbf{s}) f_n(\mathbf{s}_{q-k},\mathbf{t}) \rho_{q+k}(\mathbf{x},\mathbf{y}) \mu_n^k({\textrm{d}} \mathbf{t}) \mu_n^q({\textrm{d}} \mathbf{s}).\end{align}
To bound the term with
$k=0$
, note that
$f_n(\mathbf{x})$
is bounded by the indicator that
$x_2,\ldots,x_q$
are all contained in a ball with volume
$r_n\,: =\, \varepsilon \nu_n/2^d$
around
$x_1$
and that the WRCM built on
$x_1,\ldots,x_q$
is connected. Here
$\varepsilon>0$
is chosen such that
$\varphi(\varepsilon)>0$
and such that for all
$x \in W_n^{-r_n}$
and all
$n \geq 1$
, the ball centered at x with volume
$r_n$
is entirely contained in
$W_n$
. Such an
$\varepsilon$
exists since the sequence
$(\nu_n/n)_n$
is bounded. Since any two points in a ball with volume
$r_n$
are connected with probability at least
$p\,: =\, \varphi(\varepsilon)$
and
$\rho_q(\mathbf{x})\geq K_0(o)^q$
for
$\alpha >0$
, this yields the lower bound
With an analogous argument for the term with
$k=q-1$
in (4.2), we find that
Combining these estimates gives the assertion.
Remark 4.1. It is a notoriously challenging task to obtain lower bounds on the variance of geometric functionals of (stationary) determinantal point processes (see also the discussion in Remark (iii) after Theorem 1.14 in [Reference Błaszczyszyn, Yogeshwaran and Yukich1]). This is due to the fact that
$\rho_{2q}(\mathbf{x},\mathbf{y})\leq \rho_q(\mathbf{x}) \rho_q(\mathbf{y})$
for
$\tau\leq 0$
, which results in positive and negative terms in the expansion of the variance in (4.1). In the case
$q=1$
(where
$S_n$
is the number of points in
$ \mathcal P \cap W_n$
), we have for
$\int |K_0(x)|^2 \,{\textrm{d}} x =K_0(o)$
that the variance of
$S_n$
grows for
$n \to \infty$
as the surface area of
$W_n$
, i.e.
$\operatorname{Var} (S_n) \sim |W_n|^{{{(d-1)}/{d}}}$
(see [Reference Forrester and Honner6], (4.15)). For instance, this is the case in the Ginibre process, and similar phenomena also occur for
$\int |K_0(x)|^2 \,{\textrm{d}} x >K_0(o)$
. However, if
$\int |K_0(x)|^2 \,{\textrm{d}} x < K_0(o)$
we have
$\operatorname{Var} (S_n)\sim |W_n|$
. If
$q \geq 2$
, the situation is more complex, since the asymptotic behavior of the variance of
$S_n(G)$
is determined by the asymptotic properties of K,
$(\nu_n)_{n \geq 1}$
as well as the profile function
$\varphi$
. A concrete scenario in which we can determine the growth rate of
$\operatorname{Var} (S_n(G))$
is when
$q=2$
, G is the connected graph on two vertices,
$\nu_n\to 0$
, and the profile function
$\varphi$
has bounded support. In this case we obtain from (4.1) that
\begin{align*}\operatorname{Var} (S_n(G))&=\int_{W_n^2} \mathbb{E}[\varphi_n(x_1-x_2,U_1,U_2)] \rho_2(x_1,x_2) \,{\textrm{d}} (x_1,x_2) \\&\quad + 2\int_{W_n^3} \mathbb{E}[\varphi_n(x_1-x_2,U_1,U_2) \varphi_n(x_1-x_3,U_1,U_3)] \rho_3(x_1,x_2,x_3) \,{\textrm{d}} (x_1,x_2,x_3)\\&\quad + \int_{W_n^4} \mathbb{E}[\varphi_n(x_1-x_2,U_1,U_2) \varphi_n(x_3-x_4,U_3,U_4)]\\&\qquad \times (\rho_4(x_1,x_2,x_3,x_4) - \rho_2(x_1,x_2) \rho_2(x_3,x_4)) \,{\textrm{d}} (x_1,x_2,x_3,x_4).\end{align*}
A detailed analysis of the three different terms that proceeds along the lines of the proof of [Reference Heinrich and Klein10, Theorem 3.2] shows that the first term grows at rate
$|W_n| \nu_n$
, whereas the second and the third terms grow at a rate that is at most
$|W_n| \nu_n^2$
. Hence there is some
$v>0$
such that
5. Preliminaries
In this section we set the stage for the proof of our main results and recall some material from [Reference Schulte and Thäle20]. To keep the presentation self-contained, we start in Section 5.1 with elementary facts on some partitions which play a fundamental role in the method of cumulants. Then, in Section 5.2, we recall the method of cumulants, and following this, the main results from [Reference Schulte and Thäle20].
5.1. Partitions
Partitions play a central role in our application of the method of cumulants, and in the present section we reproduce some material from [Reference Last and Penrose14, Chapter 12.2]; see also [Reference Schulte and Thäle20, Section 2.4]. However, since we only deal with single U-statistics and not linear combinations of U-statistics, we can simplify the presentation.
Let
$m\geq1$
and let
$q\geq1$
. We then define
$N=mq$
, and for each
$\ell \in \{1,\ldots,m\}$
we let
$J_\ell\,: =\, \{(\ell-1)q+1,\ldots,\ell q\}$
. As an illustration, one may imagine N numbers arranged in an array of m rows, each having q entries. Then
$J_\ell$
is the
$\ell$
th line in this arrangement. A partition
$\sigma$
of
$\{1,\ldots,N\}$
is a collection
$\{B_1,\ldots,B_k\}$
of
$1 \leq k \leq N$
pairwise disjoint non-empty sets, called blocks, such that
$B_1 \cup \cdots \cup B_k={\{1,\ldots,N\}}$
. By
$\Pi^m(q)$
, we denote the set of all partitions
$\sigma$
such that
and by
$\Pi^{m}_{\geq2}(q)$
the set of all
$\sigma\in\Pi^m(q)$
with
$\min_{B \in \sigma}|B|\geq2$
.
Every partition
$\sigma \in \Pi^m(q)$
induces a partition
$\sigma^*$
of
$\{1,\ldots,m\}$
in the following way:
$k,\ell \in \{1,\ldots,m\}$
are in the same block of
$\sigma^*$
whenever there is a block
$B \in \sigma$
such that
$|B \cap J_k|=1$
and
$|B \cap J_\ell|=1$
. Let
$\widetilde \Pi^m(q)$
be the set of all partitions
$\sigma \in \Pi^m(q)$
such that
$|\sigma^*|=1$
, and define
$\widetilde \Pi^{m}_{\geq2}(q)$
in the same way as
$\Pi^m_{\geq2}(q)$
.
Let
$(\mathbb{X},\mathcal X)$
be a measurable space. For functions
$f\colon\mathbb{X}^q\to \mathbb{R}$
, we define their product
$f^{\otimes m}\colon\mathbb{X}^N\to \mathbb{R}$
by
Notice that for each
$\ell$
the function f in the product takes entries of
$J_\ell$
as its input.
Then, for some
$\sigma \in \Pi^m(q)$
, the function
$(f^{\otimes m})_{\sigma}\colon\mathbb{X}^{|\sigma|}\to \mathbb{R}$
is obtained by replacing in
$f^{\otimes m}$
all variables that belong to the same block of
$\sigma$
by a new common variable. For example, if
$m=q=2$
, and for a partition
$\sigma$
on
$\{1,\ldots,4\}$
that consists of the blocks
$\{2\}$
,
$\{1,3\}$
, and
$\{4\}$
, this means
(see e.g. [Reference Last and Penrose14, Chapter 12.2]). Note that in this way
$(f^{\otimes m})_{\sigma}$
is only defined up to permutations of its arguments. Since in what follows we always integrate with respect to all arguments of
$(f^{\otimes m})_{\sigma}$
, this does not cause problems.
5.2. Method of cumulants
In this section we introduce the key tool for the proof of the main results, namely the method of cumulants, whose development has been mainly attributed to V. Statulevičius. The results of earlier articles (see e.g. [Reference Rudzkis, Saulis and Statulevičius18], [Reference Statulevičius22]) are collected in the textbook [Reference Saulis and Statulevičius19]. We also want to point to the more recent survey [Reference Döring, Jansen and Schubert3]. Henceforth,
$\operatorname{cum} (X_1,\ldots,X_m)$
denotes the joint cumulant of the random variables
$X_1,\ldots, X_m$
. We recall that with
${\textrm{i}}$
the imaginary unit, this is given as
where
\[\phi_{X_1, \ldots, X_m}(t_1, \ldots, t_m)\,: =\, \mathbb{E}\Biggl[ \exp\Biggl( {\textrm{i}}\sum_{i\leq m} t_iX_i \Biggr) \Biggr]\]
is the characteristic function of the random vector
$(X_1, \ldots, X_m)$
. We henceforth always assume that all considered random variables have finite moments of all orders. Moreover, we denote the mth-order cumulant of a random variable X by
$\operatorname{cum}_m(X)$
and note that
$\operatorname{cum} (X,\ldots,X)=\operatorname{cum}_m(X)$
, where the left-hand side takes an m-tuple as its input.
The following proposition can be regarded as the application of the method of cumulants to Poisson-based U-statistics and is a variant of [Reference Schulte and Thäle20, Theorem 3.2]. In contrast to the latter, we allow for the additional factor
$(m!)^p$
in assumption (5.1) below. Although we do not need it for our purposes, we note that the statement could be generalized to linear combinations of U-statistics.
Proposition 5.1. (Variant of Theorem 3.2 in [Reference Schulte and Thäle20].) Let
$( \mathcal P_n)_n$
be a family of Poisson processes over
$\sigma$
-finite measure spaces
$((\mathbb{X}_n,\mathcal X_n,\mu_n))_n$
and let
$f_n\colon \mathbb{X}_n^{q}\to \mathbb{R}$
,
$n \in \mathbb{N}$
, be measurable and satisfy the integrability condition
for
$i\in \{0,\ldots,q\}$
and
$\text{sup}_{n \geq 1} \|f_n\|_{L^2(\mu_n^{q})}^2>0$
. Define for
$n \geq 1$
the random variables
Assume that there is a positive real-valued sequence
$(\beta_n)_{n\geq1}$
and some
$p\geq0$
, such that for any
$n \in \mathbb{N}$
, for all
$\sigma \in \widetilde \Pi_m(q)$
and
$m \geq 3$
,
Then
satisfies
$\operatorname{\bf MDP} $
,
$\operatorname{\bf CI}$
, and
$\operatorname{\bf NACC}$
, all with parameters
$(p+q-1,(q^{-3q}\beta_n)_n)$
.
Proof. The main tool of the cumulant method is to find parameters
$\gamma\geq0$
and
$\Delta_n>0$
, such that the cumulants of the random variable
$Z_n/\sqrt{\operatorname{Var} (Z_n)}$
as in the proposition satisfy the condition
for all
$m\geq3$
and
$n \in \mathbb{N}$
. This condition is widely known as the Statulevičius condition and implies that
$\operatorname{\bf MDP}$
,
$\operatorname{\bf CI}$
, and
$\operatorname{\bf NACC}$
are all satisfied with parameters
$(\gamma, (\Delta_n)_{n \geq 1})$
; for more details we refer to [Reference Döring, Jansen and Schubert3, Section 2]. To do so, we follow the arguments in the proof of [Reference Schulte and Thäle20, Theorem 3.1]. If we fix some
$m\geq3$
, by definition of the cumulant, its multilinearity, and the triangle inequality, we have
Now, according to [Reference Schulte and Thäle20, Theorem 3.7], we can rewrite
\begin{align*}|\operatorname{cum}_m(Z_n,\ldots,Z_n)| &= \Biggl| \sum_{\sigma\in\widetilde{\Pi}^m(q)} \int_{\mathbb{X}^{|\sigma|}} (f_n^{\otimes m})_{\sigma} \, {\textrm{d}} \mu^{|\sigma|} \Biggr| \\&\leq \big| \widetilde{\Pi}^m(q)\big| \text{sup}_{\sigma\in\widetilde{\Pi}^m(q)} \biggl| \int_{\mathbb{X}^{|\sigma|}} (f_n^{\otimes m})_{\sigma} \, {\textrm{d}} \mu^{|\sigma|} \biggr| .\end{align*}
Additionally, we observe
where the first inequality is a straightforward consideration by the definitions of
$\widetilde \Pi^m(q)$
and
$\Pi^m(q)$
respectively, and the second one is due to the first part of [Reference Schulte and Thäle20, Proposition 6.1]. Putting this together with assumption (5.1) gives
so that in comparison to the above cumulant bound we observe that
$\gamma=p+q-1$
and
$\Delta_n=\beta_nq^{-3q}$
.
5.3. Parameter specifications
In this section we prepare the proofs of our main theorems by explaining how we choose the model parameters in Proposition 5.1.
Even if all Poisson points
$\{(X_i, U_i)\}_i$
are assumed as given, in the current framework the decision whether to put an edge between
$(X_i, U_i)$
and
$(X_j, U_j)$
still involves additional randomness. We resolve this technicality in the same way as in [Reference Penrose17] (see particularly Section 4 therein). More precisely, we formally enlarge the state space of
$ \mathcal P_n$
from
$W \times [1, \infty)$
to
$\mathbb{X}\,: =\, W \times [1, \infty) \times [0, 1]^{\mathbb{N}}$
and augment each Poisson point
$(X_i, U_i)$
with additional i.i.d. uniform marks
$(T_i^{(j)})_{j \geq 1}$
. Hence we choose
$\mu_n\,: =\, t_n {\textrm{d}} x \otimes \mathbb{P}_U \otimes (\text{Unif}[0,1])^{\mathbb{N}}$
. We then index the points of
$ \mathcal P_n$
in lexicographic order and put an edge between
$P_i$
and
$P_j$
with
$i < j$
if and only if
and thereby realize the edge probability
$\varphi_n(X_i - X_j, U_i, U_j)$
.
6. Proof of Theorem 2.1
Let G be a fixed connected graph on vertices
$1,\ldots,q$
. For
let
$f_n(p_1,\ldots,p_q)$
be
$1/q!$
times the number of subgraphs in the WRCM built on these points that are isomorphic to G. While now the basic idea is similar to the representation given in [Reference Schulte and Thäle20, (7.1)], where the functionals for the subgraph count in the classical random connection model are given as a linear combination of indicator variables, the presence of long-range correlations through the profile function
$\varphi$
and the weights requires additional work.
Let
$\sigma\in\widetilde{\Pi}^m(q)$
be a partition, and note that it induces a connected graph (V, E) with vertex set
$V=\{1,\ldots,|\sigma|\}$
, where the block
$B_i \in \sigma$
has been identified with node
$i\in V$
,
$i=1,\ldots, |\sigma|$
. There is an edge
$(i,j)\in E$
if there are
$k_i,k_j\in \{1,\ldots,q\}$
and
$\ell \in \{0,\ldots,m-1\}$
, such that
$\ell q + k_i\in B_{i}$
,
$\ell q + k_j \in B_{j}$
and there is an edge between
$k_i$
and
$k_j$
in G. For instance, let G be the graph on vertices
$\{1,2,3\}$
with edges (1, 2) and (2, 3), let
$m=2$
and
$\sigma=\{B_1,\ldots,B_5\}$
with
$B_1=\{1,4\}$
,
$B_2=\{2\}$
,
$B_3=\{3\}$
,
$B_4=\{5\}$
,
$B_5=\{6\}$
. Then
$V=\{1,\ldots,5\}$
and
$E=\{(1,2), (2,3), (1,4), (4,5)\}$
. Note, moreover, that in this case
In general, we have
\begin{align}\int_{\mathbb{X}^{|\sigma|}} (f_n^{ \otimes m})_\sigma \,{\textrm{d}} \mu_n^{|\sigma|} = t_n^{|\sigma|} \int_{W^{|\sigma|}} \mathbb{E}\Biggl[\prod_{(i,j)\in E} \varphi_n(x_i - x_j, U_i, U_j)\Biggr] \,{\textrm{d}} (x_1,\ldots,x_{|\sigma|}) .\end{align}
We shall give a few more details regarding the above equation. On the left-hand side of (6.1), the integration over
$\mathbb{X}^{|\sigma|}$
formally is an integration over
$(W\times[1, \infty)\times[0,1]^{\mathbb{N}})^{|\sigma|}$
and the integral is split accordingly. The integrand is then the indicator that for an edge
$(i,j)\in E$
(the edge set of the graph induced by
$\sigma$
), there is an edge in the WRCM between the points
$P_i$
and
$P_j$
. The latter now depends on the marks
$T_i^{(j)}$
as described above. The integral over
$[0,1]^{|\sigma|}$
is then formally solved by writing the probability that
$T_i^{(j)}\leq\varphi_n( \cdot )$
as
$\varphi_n( \cdot )$
. Further, the expectation on the right-hand side of (6.1) represents the integral over
$[1,\infty)^{|\sigma|}$
so that the only ‘visible’ integral is the one with respect to the Lebesgue measure
$t_n^{|\sigma|}{\textrm{d}} (x_1,\ldots,x_{|\sigma|})$
.
Next we fix a spanning tree of (V, E) with induced edge set
$E_s\subseteq E$
. Then we successively integrate the tree
$E_s$
, where we use spherical coordinates in each integration step. Since the factors in the product on the right-hand side of (6.1) are at most one, this indeed gives an upper bound.
In more detail, first observe that by Fubini’s theorem and the fact that
$E_s\subseteq E$
, the integral in (6.1) is bounded from above by
\begin{equation*}\mathbb{E}\Biggl[ \int_{W^{|\sigma|}} \prod_{(i,j)\in E_s} \varphi_n(x_i,x_j,U_i,U_j) \,{\textrm{d}} x_1,\ldots,{\textrm{d}} x_{|\sigma|} \Biggr] .\end{equation*}
For better illustration, we consider one of the
$|\sigma|$
-fold integrals separately and let
$(i,j)\in E_s$
. Then,
The right-hand side integral over
$\mathbb{R}^d$
can now be rewritten using spherical coordinates around
$x_i$
. This gives
where we have used that
$\int_0^{\infty}\varphi(s)\,{\textrm{d}} s=1$
by assumption from Section 2. Now, since the edge set of the spanning tree satisfies
$|E_s|=|\sigma|-1$
by construction, an iteration of the above yields
\begin{align*}&\mathbb{E}\Biggl[ \int_{W^{|\sigma|}} \prod_{(i,j)\in E_s} \varphi_n(x_i,x_j,U_i,U_j) \,{\textrm{d}} x_1,\ldots,{\textrm{d}} x_{|\sigma|} \Biggr] \\&\quad \leq \int_W\,{\textrm{d}} x_{|\sigma|} \, \nu_n^{|\sigma|-1} \mathbb{E}\Biggl[ \prod_{(i,j)\in E_s} \kappa(U_i,U_j) \Biggr].\end{align*}
Since the first factor on the right-hand side equals the volume of W, we have arrived at
\begin{equation}\int_{\mathbb{X}^{|\sigma|}} (f_n^{\otimes m})_\sigma \,{\textrm{d}} \mu_n^{|\sigma|} \leq t_n^{|\sigma|} \nu_n^{|\sigma|-1}|W| \, \mathbb{E}\Biggl[ \prod_{(i,j)\in E_s} \kappa(U_i,U_j) \Biggr].\end{equation}
So the only thing left to care about is the expectation on the right-hand side of (6.2). Therefore let
$\operatorname{deg}_{\operatorname{s}} (i)$
denote the degree of
$i \in \{1,\ldots,|\sigma|\}$
in
$(V,E_s)$
. Then
$\kappa(u,v)\leq u v$
and (MU) give
\begin{align*}\mathbb{E}\Biggl[ \prod_{(i,j)\in E_s} \kappa(U_i,U_j) \Biggr] &\leq \prod_{i\leq|\sigma|} M_U(\operatorname{deg}_{\operatorname{s}} (i)) \notag \\&\leq \prod_{i \leq |\sigma|} c_{U, 1}^{\operatorname{deg}_{\operatorname{s}} (i)} ( \operatorname{deg}_{\operatorname{s}} (i)!)^{c_{U, 2}} \nonumber\\&=c_{U, 1}^{2(|\sigma|-1)} \prod_{i\leq |\sigma|} (\operatorname{deg}_{\operatorname{s}} (i) ! )^{c_{U, 2}}.\end{align*}
Here the product over
$i=1,\ldots,|\sigma|$
can be expressed as
\begin{align*}\prod_{i\leq|\sigma|} (\operatorname{deg}_{\operatorname{s}} (i) ! )^{c_{U, 2}} = \exp\Biggl(c_{U, 2} \sum_{i\leq |\sigma|}\log\Gamma(\operatorname{deg}_{\operatorname{s}} (i)+1)\Biggr) .\end{align*}
First we show that the function
$f(s_1,\ldots,s_{|\sigma|})\,: =\, \sum_{i\leq |\sigma|}\log\Gamma(s_i+1)$
is convex. Indeed, for
$n\geq1$
, the
$(n+1)$
th-order derivative of
$\log\Gamma(s)$
is the polygamma function of order n given by
This implies that
\begin{align*}\dfrac{{\textrm{d}} ^2}{{\textrm{d}} s^2}\log\Gamma(s)=\Psi_1(s)=\sum_{k\geq 0}\dfrac{1}{(s+k)^2} >0,\end{align*}
which yields convexity of the function
$\log\Gamma(s)$
. Hence, on the set
the function f takes its maximum at an extremal point. In other words, there is some
$i_0 \in \{1,\ldots,|\sigma|\}$
such that
$s_{i_0} = |\sigma| - 1$
, and
$s_i = 1$
for
$i \ne i_0$
. In particular,
where we have used
$|\sigma| \leq m(q-1)+1$
and the elementary inequality
which holds for all
$c\geq 1$
and
$k \in \mathbb{N}$
. Thus,
\begin{align}\mathbb{E}\Biggl[ \prod_{(i,j)\in E_s} \kappa(U_i,U_j) \Biggr] \leq c_{U, 1}^{2(|\sigma|-1)}(q-1)^{m(q-1)c_{U, 2}} (m!)^{(q-1)c_{U, 2}} \leq b_{\textrm{SG}}^m (m!)^{(q-1)c_{U, 2}},\end{align}
where we recall that
from Theorem 2.1. Hence we arrive at
Now, by condition (VSG), there exists some constant
$v>0$
such that
Next we distinguish the cases
$ t_n \nu_n \leq 1$
and
$ t_n \nu_n>1$
. If
$t_n\nu_n \leq 1$
, we use
$|\sigma|\geq q$
and find with
$a\,: =\, (q-1)c_{U, 2}$
that
\begin{align*}(m!)^{-a}(\operatorname{Var} S_n(G))^{-m/2} \int_{\mathbb{X}^{|\sigma|}} (f_n^{\otimes m})_\sigma \,{\textrm{d}} \mu_n^{|\sigma|}&\leq \dfrac{|W| t_n^q b_{\textrm{SG}}^m \nu_n^{q-1}}{|W|^{m/2}v^{m/2}t_n^{mq/2}\nu_n^{m(q-1)/2}} \\&=\dfrac{b_{\textrm{SG}}^m |W|^{-(m-2)/2}}{v^{m/2} t_n^{(m-2)q/2} \nu_n^{(m-2)(q-1)/2}}\\& \leq (1 \vee b_{\textrm{SG}}^2/v)^{m-2} \bigl(b_{\textrm{SG}}/\sqrt{|W| v t_n^q \nu_n^{q-1}}\bigr)^{m-2}.\end{align*}
If
$t_n\nu_n \geq 1$
, we use the bound
$|\sigma|\leq m(q-1)+1$
and obtain
\begin{align*}(m!)^{-a}(\operatorname{Var} S_n(G))^{-m/2}\int_{\mathbb{X}^{|\sigma|}} (f_n^{\otimes m})_\sigma \,{\textrm{d}} \mu_n^{|\sigma|}&\leq \dfrac{|W| t_n^{m(q-1)+1} b_{\textrm{SG}}^m \nu_n^{m(q-1)}}{|W|^{m/2}v^{m/2}t_n^{mq-m/2}\nu_n^{m(q-1)}}\\&=\dfrac{|W|^{-(m-2)/2}t_n^{1-m/2}b_{\textrm{SG}}^m}{v^{m/2}}\\& \leq \bigl(1 \vee b_{\textrm{SG}}^2/v\bigr)^{m-2} \bigl(b_{\textrm{SG}}/\sqrt{|W| v t_n }\bigr)^{m-2}.\end{align*}
Therefore a cumulant bound as in (5.1) is satisfied and the result follows from Proposition 5.1.
7. Proof of Theorem 2.2
In this section we prove Theorem 2.2. We apply Proposition 5.1 with state space
$\mathbb{X}\,: =\, W \times [1, \infty) \times [0, 1]^{\mathbb{N}}$
,
$q=2$
and
In the proof, we replace the
$\tau$
-power-weighted edge length
$\|X_i-X_j\|^{\tau}$
by
Note that the linear scaling of
$S_n^{(\tau)}$
by
$|B_1|^{\tau}$
has no influence on the fraction
$S_n^{(\tau)}/\sqrt{\operatorname{Var} (S_n^{\tau})}$
and therefore does not affect our bounds. As we will see below, this reparameterization will make the integral computations substantially more accessible.
As in Section 6, we use the fact that the partition
$\sigma$
induces a connected graph (V, E) on the vertex set
$V=\{1,\ldots,|\sigma|\}$
. In fact, in the present setting this graph is far easier to comprehend since
$q = 2$
. Moreover, for
$(i,j)\in E$
we henceforth let
$m_{ij}$
be the multiplicity of (i, j) in
$\sigma$
and note that
$\sum_{(i,j)\in E}m_{ij}=m$
. Then,
\begin{align}&\int_{\mathbb{X}^{|\sigma|}} (f_n^{\otimes m})_\sigma \,{\textrm{d}} \mu_n^{|\sigma|} = t_n^{|\sigma|}\mathbb{E}\Biggl[\int_{W^{|\sigma|}} \prod_{(i,j)\in E} |B_{\|x_i-x_j\|}|^{\tau m_{ij}} \varphi_n(x_i - x_j, U_i, U_j) \,{\textrm{d}} (x_1,\ldots,x_{|\sigma|}) \Biggr].\end{align}
Again, we fix the edge set
$E_s \subseteq E$
of a spanning tree and rewrite the inner integral in the above as
\begin{align*}&\int_{W^{|\sigma|}} \Biggl[ \prod_{(i,j)\in E_s} \varphi_n(x_i - x_j, U_i, U_j)) |B_{\|x_i-x_j\|}|^{\tau m_{ij}} \Biggr] \\&\qquad \times \Biggl[ \prod_{(i,j)\in E \setminus E_s} \varphi_n(x_i - x_j, U_i, U_j) |B_{\|x_i-x_j\|}|^{\tau m_{ij}} \Biggr] \,{\textrm{d}} (x_1,\ldots,x_{|\sigma|})\\&\quad\leq \Biggl[\prod_{(i,j)\in E \setminus E_s} (\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}{}} M_{\varphi}'(\tau m_{ij})\Biggr]\\&\qquad \times\int_{W^{|\sigma|}} \prod_{(i,j)\in E_s} \varphi_n(x_i-x_j,U_i,U_j) |B_{\|x_i-x_j\|}|^{\tau m_{ij}}\,{\textrm{d}} (x_1,\ldots,x_{|\sigma|}),\end{align*}
where
$M_{\varphi}'$
is given at (MPHI). Next, we bound the integral over
$x_1,\ldots,x_{|\sigma|}$
. Again, successively integrating out the contributions of the spanning tree leaves gives the bound
\begin{align*}& \int_{W^{|\sigma|}} \prod_{(i,j)\in E_s} \varphi_n(x_i-x_j,U_i,U_j) |B_{\|x_i-x_j\|}|^{\tau m_{ij}}\,{\textrm{d}} (x_1,\ldots,x_{|\sigma|})\\&\quad\leq |W| \prod_{(i,j) \in E_s} [(\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}{}+1} M_{\varphi}(\tau m_{ij})].\end{align*}
Now, assumption (MPHI) gives that
Note that for
$d_1,\ldots,d_k\geq0$
and identically distributed random variables
$Y_1,\ldots,Y_k$
, Hölder’s inequality gives
Using this,
$|\sigma|\leq m+1$
, and (6.3) shows that (7.1) is bounded by
\begin{align*}&t_n^{|\sigma|}|W| c_{\varphi, 1}^{{\tau m}{}} \Gamma(1 + \tau m)^{c_{\varphi, 2}}\mathbb{E}\Biggl[ \prod_{(i,j) \in E_s} (\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}{}+1} \prod_{(i,j) \in E \setminus E_s} (\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}{}} \Biggr]\\&\quad =t_n^{|\sigma|}|W| c_{\varphi, 1}^{{\tau m}{}} \Gamma(1 + \tau m)^{c_{\varphi, 2}}\mathbb{E}\Biggl[ \prod_{(i,j) \in E} (\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}+\mathbf{1}\{(i,j)\in E_s\}} \Biggr]\\&\quad \leq t_n^{|\sigma|}|W| c_{\varphi, 1}^{{\tau m}{}} \Gamma(1 +\tau m)^{c_{\varphi, 2}} \nu_n^{{\tau m}{}+|\sigma|-1}\mathbb{E}\bigl[ \kappa(U_1,U_2)^{(\tau + 1) m} \bigr]\\&\quad \leq t_n^{|\sigma|}|W| (c_{\varphi, 1} (\tau \vee 1)^{c_{\varphi, 2}})^{{\tau m}{}} (m!)^{c_{\varphi, 2}\tau } \nu_n^{{\tau m}{}+|\sigma|-1}\mathbb{E}\bigl[ \kappa(U_1,U_2)^{(\tau + 1) m} \bigr],\end{align*}
where we have used that
$\Gamma(1+\tau m) \leq (\tau \vee 1)^{\tau m} (m!)^{\tau}$
in the last inequality, which follows from convexity for
$\tau\leq 1$
and from (6.3) for
$\tau >1$
. Hence it remains to bound the expected value on the right-hand side. To do so, since
$\kappa(u,v) \leq uv$
, using condition (MU) we find with the bound (6.3) that
\begin{align}\mathbb{E}\bigl[ \kappa(U_1,U_2)^{(\tau+1) m} \bigr]^{1/2} &\leq c_{U, 1}^{(\tau+1) m}\Gamma(1+ (\tau+1) m)^{c_{U, 2}}\nonumber \\& \leq (c_{U, 1} (\tau+1)^{c_{U, 2}})^{(\tau+1) m}(m!)^{c_{U, 2} (\tau+1)}.\end{align}
Moreover, by condition (VEL), there exists some
$v>0$
such that
Now we combine these bounds and consider the cases
$t_n \nu_n\geq 1$
and
$t_n \nu_n <1$
separately. Recall that
$b_{\textrm{EL}}\,: =\, (c_{\varphi, 1} (\tau\vee 1)^{c_{\varphi, 2}})^{{\tau }{}}(c_{U, 1} (\tau + 1)^{c_{U, 2}})^{2(\tau + 1)}$
and
$a\,: =\, 2c_{U, 2} (\tau+1) + c_{\varphi, 2} \tau$
. If
$t_n \nu_n <1$
, we use
$|\sigma|\geq 2$
and obtain
\begin{align*}(m!)^{-a}\operatorname{Var} (S_n^{(\tau d)})^{-m/2} \, \int_{\mathbb{X}^{|\sigma|}} ( f_n^{\otimes m})_\sigma \,{\textrm{d}} \mu_n^{|\sigma|} & \leq \dfrac{|W|t_n^2 \nu_n^{\tau m} b_{\textrm{EL}}^m \nu_n } {|W|^{m/2}v^{m/2} \nu_n^{\tau m} t_n^{m} \nu_n^{m/2} }\\&=\dfrac{b_{\textrm{EL}}^m }{|W|^{(m - 2)/2}v^{m/2} t_n^{m-2}\nu_n^{(m-2)/2}}\\& \leq \bigl(1 \vee b_{\textrm{EL}}^2/v\bigr)^{m-2} \bigl(b_{\textrm{EL}}/\sqrt{|W| v t_n^2 \nu_n}\bigr)^{m-2}.\end{align*}
If
$t_n \nu_n \geq1$
, because of
$|\sigma|\leq m+1$
, we have
\begin{align*}(m!)^{-a} \operatorname{Var} (S_n^{(\tau d)})^{-m/2} \, \int_{\mathbb{X}^{|\sigma|}} ( f_n^{\otimes m})_\sigma \,{\textrm{d}} \mu_n^{|\sigma|}& \leq \dfrac{|W|t_n^{m+1} \nu_n^{\tau m} b_{\textrm{EL}}^m \nu_n^m } {|W|^{m/2}v^{m/2} \nu_n^{\tau m}t_n^{2m-m/2} \nu_n^{m} }\\&=\dfrac{b_{\textrm{EL}}^m }{|W|^{(m - 2)/2}t_n^{(m - 2)/2}v^{m/2}}\\&\leq \bigl(1 \vee b_{\textrm{EL}}^2/v\bigr)^{m-2} \bigl(b_{\textrm{EL}}/\sqrt{|W| v t_n}\bigr)^{m-2}.\end{align*}
8. Proof of Theorems 2.3 and 2.4
Before giving the proof of Theorem 2.3, we provide a formula from the Appendix of [Reference Heinrich and Klein10] (or see Lemma 1 in [Reference Feng, Götze and Yao5]) for the mth cumulant of a U-statistic of an
$\alpha$
-DPP, and explain how this formula can be interpreted graphically. This will allow us to proceed similarly as in the proof of Theorem 2.1, with the difference that edges in the graph induced by
$\sigma$
can now have two different meanings.
Given a partition
$\sigma \in \Pi^m(q)$
of
$\{1,\ldots,mq\}$
, let
$\rho$
be a partition of
$\{1,\ldots,|\sigma|\}$
. Recalling the definition of
$J_t$
from Section 5.1, we call the pair
$(\sigma,\rho)$
decomposable if there are a decomposition
$\{T_1,T_2\}$
of
$\{1,\ldots,q\}$
and decompositions
$\sigma=\sigma^{(1)} \cup \sigma^{(2)}$
and
$\rho=\rho^{(1)} \cup \rho^{(2)}$
such that
$\sigma^{(1)}$
is a partition of
$\bigcup_{t \in T_1} J_t$
,
$\sigma^{(2)}$
is a partition of
$\bigcup_{t \in T_2} J_t$
,
$\rho^{(1)}$
is a partition of
$T_1$
, and
$\rho^{(2)}$
is a partition of
$T_2$
. Otherwise
$(\sigma,\rho)$
is indecomposable. Given
$\sigma \in \Pi^m(q)$
, let
$\Pi(q;\,\sigma)$
be the set of all partitions
$\rho$
such that the pair
$(\sigma, \rho)$
is indecomposable. This notion of indecomposability is compatible with the notion of indecomposable integrals used in [Reference Heinrich and Klein10] in the following sense. An integral is indecomposable in the sense of [Reference Heinrich and Klein10] if it cannot be defined with respect to a decomposable partition. Hence the notion of indecomposable partitions is less restrictive than indecomposable integrals.
Therefore, with
$f_n$
defined as in the proof of Theorem 2.1, we have
where
is the kth cumulant density of the
$\alpha$
-DPP and we recall that
$\operatorname{Per} (k)$
is the set of all permutations of
$1,\ldots,k$
.
As above, we note that the choice of partitions
$\Pi^m(q)$
and
$\Pi(q;\,\sigma)$
induces a graph on
$\{1, \ldots, |\sigma|\}$
. However, in contrast to the Poisson setting, an edge in this graph can now have two different meanings, and therefore we refer to them as type I or type II edges. First, an edge of type I is put between nodes i and j if the product of the functions
$f_n$
imposes an edge. This is just as in Theorems 2.1 and 2.2. However, secondly, an edge of type II is now also if i and j are members of the same element in
$\rho \in \Pi(q;\,\sigma)$
. This is new in the determinantal case. Then the indecomposability assumption means that the so-constructed graph is connected.
Proof of Theorem 2.3. First we bound the number of partitions involved in the double sum in (8.1). From [Reference Schulte and Thäle20, Proposition 6.1] we have
$|\Pi^m(q)|\leq q^{qm}(m!)^q$
. To bound the sum over the partitions
$\Pi(q;\,\sigma)$
, we observe from (8.2) that when expanding the kth-order cumulant measure, we obtain a sum consisting of
$(m - 1)! \leq m!$
summands. For
$|\rho|=r$
, let
$\rho_1,\ldots,\rho_r$
denote the r blocks of
$\rho$
. Hence, given
$\sigma \in \Pi^m(q)$
, we obtain the bound
\begin{align*}\sum_{\rho \in \Pi(q;\,\sigma)} \prod_{Q \in \rho} |\operatorname{Per} (|Q|)|&= \sum_{r=1}^{|\sigma|}\sum_{\substack{\rho \in \Pi(q;\,\sigma)\\ |\rho|=r}} |\rho_1|! \cdots |\rho_r|!\\& \leq \sum_{r=1}^{|\sigma|} \dfrac{2^{|\sigma|-1} |\sigma|!}{r!} \\& \leq 2^{|\sigma|} |\sigma|! \\& \leq (2q)^{qm} (m!)^q,\end{align*}
where the upper bound of the inner sum holds by [Reference Eichelsbacher, Raič and Schreiber4, Lemma 3.5] and we have used (6.3) in the last step. Since
$|\alpha| \leq 1$
, this gives that
$|\operatorname{cum} (S_n(G))|$
is bounded by
\begin{align}(2q^2)^{qm} (m!)^{2q} \sup\limits_{\substack{\sigma \in \Pi^m(q)\\ \rho \in \Pi(q;\,\sigma)}}&\int_{\mathbb{X}^{|\sigma|}}(f_n^{\otimes m })_{\sigma} \prod_{Q \in \rho}\sup\limits_{\pi \in \operatorname{Per} (|Q|)} |k_{1,\pi(2)} k_{\pi(2),\pi(3)} \cdots k_{\pi(|Q|),1}|\, \mu_n^{|\sigma|}({\textrm{d}} \mathbf{x}), \end{align}
where
$k_{i,j}\,: =\, K(x_i,x_j)$
for
$i,j=1,\ldots,|Q|$
.
Hence it remains to bound the individual integrands in (8.3), which consist of a product of the functions
$f( \cdot )$
and products of the kernels
$K(\cdot, \cdot)$
.
We construct a spanning tree such that for points
$x_i$
,
$x_j$
in the same element of the partition
$\rho$
, we place a type II edge
$(x_i,x_j)$
in the spanning tree if the factor
$K(x_i,x_j)$
is present in the integral. We put type I edges in the spanning tree that connect the different
$Q \in \rho$
. To bound the integral (8.3), we integrate over the edges of the spanning tree. If we integrate over a type I edge ((x, u), (y, v)), then we obtain a contribution of
$K_0(o) \nu_n \kappa(u,v)$
. This is analogous to the proof of Theorem 2.1. Second, each time we integrate over a type II edge, we obtain a contribution bounded by
$\|K_0\|_1$
. This follows from the integrability of the covariance kernel K. Let
$E_{s,1}$
denote the set of type I in the spanning tree and let
$E_{s,2}$
denote the set of type II edges in the spanning tree, respectively. Since
$\text{sup}_{x, y \in \mathbb{R}^d}|K(x,y)|\leq K_0(o)\leq 1$
, we deduce from (6.4) the bound
\begin{align*}&\mathbb{E} \Biggl[ \int_{W_n^{|\sigma|}} \prod_{(i,j)\in E_{s,1}} \varphi_n(x_i-x_j,U_i,U_j) \prod_{(i,j)\in E_{s,2}} |K(x_i, x_j)| \, {\textrm{d}} (x_1,\ldots,x_{|\sigma|}) \Biggr] \\&\quad \leq |W_n| \nu_n^{|E_{s,1}|} \mathbb{E}\Biggl[ \prod_{(i,j)\in E_{s,1}} \kappa(U_i,U_j) \Biggr] \|K_0\|_1^{|E_{s,2}|} \\&\quad \leq |W_n| \nu_n^{|E_{s,1}|} (m!)^{(q-1)c_{U, 2}} b_{\textrm{SG}}^m \|K_0\|_1^{|E_{s,2}|},\end{align*}
where
$b_{\textrm{SG}}$
is given in Theorem 2.1. Since
$q-1 \leq |E_{s,1}|\leq m(q-1)$
and
$|E_{s,2}|\leq m-1$
, we can in general conclude that
From here, the assertion follows as in the proof of Theorem 2.1.
Proof of Theorem 2.4. To prove Theorem 2.4, we combine arguments used in the proofs of Theorems 2.2 and 2.3. Again, we replace the
$\tau$
-power-weighted edge length
$\|X_i-X_j\|^\tau$
by
$|B_{\|X_i-X_j\|}|^\tau$
to ease the presentation. For
$m \geq 1$
, let
$\sigma \in \Pi^m(2)$
and
$\rho \in \Pi(2;\sigma)$
. Let (V, E) be the connected graph induced by the pair
$(\sigma,\rho)$
on the vertex set
$V=\{1,\ldots,|\sigma|\}$
. As above, we can partition E into a set
$E_1$
of type I edges and a set
$E_2$
of type II edges. For
$(i,j)\in E_1$
, let
$m_{ij}$
be the multiplicity of (i, j) in (V, E) and note that
$\sum_{(i,j)\in E_1}m_{ij}=m$
. Let
$E_{s,2}\subseteq E_2$
be such that the induced subgraph of (V, E) with edge set
$E_1 \cup E_{s,2}$
is connected. Since
$\text{sup}_{x, y \in\mathbb{R}^d}|K(x,y)| \leq K_0(o)\leq 1$
for all
$x,y \in W_n$
, we obtain analogously to (8.3) that
$|\operatorname{cum}_m(S_n^{(\tau d)})|$
is bounded by
\begin{align*}64^m (m!)^4 \text{sup}_{\sigma \in \Pi^m(q)} \text{sup}_{\rho \in \Pi(q;\,\sigma)}\mathbb{E} \Biggl[ &\int_{W_n^{|\sigma|}} \prod_{(i,j)\in E_1} \varphi_n(x_i-x_j,U_i,U_j) |B_{\|x_i-x_j\|}|^{\tau} \\&\quad \times \prod_{(i,j)\in E_{s,2}} |K(x_i, x_j)| \, {\textrm{d}} (x_1,\ldots,x_{|\sigma|}) \Biggr].\end{align*}
Now we fix some
$E_{s,1} \subseteq E_1$
such that
$E_{s,1} \cup E_{s,2}$
is the edge set of a spanning tree of (V, E). Then we find as in the proof of Theorem 2.2 that
$|\operatorname{cum}_m(S_n^{(\tau d)})|$
is bounded by
\begin{align}&64^m (m!)^4 \mathbb{E}\Biggl[\prod_{(i,j)\in E_1 \setminus E_{s,1}} (\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}{}} M_{\varphi}'(\tau m_{ij}) \nonumber\\&\quad \times \int_{W_n^{|\sigma|}} \prod_{(i,j)\in E_{s,1}} \varphi_n(x_i-x_j,U_i,U_j) |B_{\|x_i-x_j\|}|^{\tau} \prod_{(i,j)\in E_{s,2}} |K(x_i, x_j)| \, {\textrm{d}} (x_1,\ldots,x_{|\sigma|}) \Biggr], \end{align}
where
$M_{\varphi}'$
is given at (MPHI). Next, we bound the integral over
$x_1,\ldots,x_{|\sigma|}$
. Again, successively integrating out the contributions of the leaves implies that the expectation above is bounded by
Now assumption (MPHI) and
$\sum_{(i,j) \in E_1} m_{ij}= m$
give that
Moreover, analogously to the proof of Theorem 2.1, by the Hölder inequality,
\begin{align*}&\mathbb{E}\Biggl[ \prod_{(i,j) \in E_{s,1}} (\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}{}+1} \prod_{(i,j) \in E_1 \setminus E_{s,1}} (\nu_n \kappa(U_i,U_j))^{{\tau m_{ij}}{}} \Biggr]\\&\quad \leq \nu_n^{\tau m+|E_{s,1}|}\mathbb{E}\bigl[ \kappa(U_1,U_2)^{(\tau + 1) m} \bigr].\end{align*}
Thus (8.4) is bounded by
Using
by (7.2) and the bounds
$q-1 \leq |E_{s,1}|\leq m(q-1)$
and
$|E_{s,2}|\leq m-1$
, we arrive at the estimate
where
Now the claim follows as in the proofs above.
Acknowledgements
We would like to thank Friedrich Götze for pointing us to the recent work [Reference Feng, Götze and Yao5]. We are also grateful to two anonymous reviewers for their thoughtful comments which improved our article.
Funding information
This work was supported by a visit grant by the Danish Data Science Academy (DDSA-V-2023-009), the VILLUM FONDEN (VIL69126), and by the NWO Gravitation project NETWORKS (024.002.003).
Competing interests
There were no competing interests to declare which arose during the preparation or publication process of this article.