Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-21T08:16:33.696Z Has data issue: false hasContentIssue false

Limiting shape for first-passage percolation models on random geometric graphs

Published online by Cambridge University Press:  24 April 2023

Cristian F. Coletti*
Affiliation:
Federal University of ABC (UFABC)
Lucas R. de Lima*
Affiliation:
Federal University of ABC (UFABC)
Alexander Hinsen*
Affiliation:
Weierstrass Institute for Applied Analysis and Stochastics
Benedikt Jahnel*
Affiliation:
Technische Universität Braunschweig
Daniel Valesin*
Affiliation:
University of Warwick
*
*Postal address: Center for Mathematics, Computation, and Cognition, Universidade Federal do ABC, Avenida dos Estados, 5001 Bangu, Santo André, São Paulo, Brazil.
*Postal address: Center for Mathematics, Computation, and Cognition, Universidade Federal do ABC, Avenida dos Estados, 5001 Bangu, Santo André, São Paulo, Brazil.
****Postal address: Weierstrass Institute for Applied Analysis and Stochastics, Mohrenstraße 39, 10117 Berlin, Germany. Email: alexander.hinsen@wias-berlin.de
*****Postal address: Institut für Mathematische Stochastik, Technische Universität Braunschweig, Universitätsplatz 2, 38106 Braunschweig, Germany & Weierstrass Institute for Applied Analysis and Stochastics, Mohrenstraße 39, 10117 Berlin, Germany. Email: benedikt.jahnel@tu-braunschweig.de
******Postal address: Department of Statistics, University of Warwick, Coventry, CV4 7AL, United Kingdom. Email: daniel.valesin@warwick.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed random variables on the random infinite connected component. We provide sufficient conditions for the existence of the asymptotic shape, and we show that the shape is a Euclidean ball. We give some examples exhibiting the result for Bernoulli percolation and the Richardson model. In the latter case we further show that it converges weakly to a nonstandard branching process in the joint limit of large intensities and slow passage times.

Type
Original Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of Applied Probability Trust

1. Introduction, main results, and examples

First-passage percolation (FPP) was initially introduced in [Reference Hammersley and Welsh4] to study the spread of fluids through a random medium. Since then, several variations of the percolation process have been extensively investigated (see [Reference Auffinger, Damron and Hanson1] for an overview of FPP on $\mathbb{Z}^d$ ) due to their considerable theoretical consequences and applications. An FPP determines a random metric space by assigning random weights to the edges of a graph.

We consider the FPP model defined on a random geometric graph (RGG) in $\mathbb{R}^d$ with $d \geq 2$ . Here, the RGG is defined as in [Reference Penrose11] by setting the vertices to be given by a homogeneous Poisson point process (PPP) with intensity $\lambda>0$ , and the edges are defined between any pair of vertices that are within a Euclidean distance smaller than a fixed threshold $ {r}>0$ . This random graph is also known as the Poisson–Gilbert disk model. It is a graph associated to the Poisson–Boolean model in continuum percolation, and it can also be seen as a particular case of the random-connection model (see, for instance, [Reference Meester and Roy9]).

The properties and other details regarding the structure and definition of the process will be given later in the text. We present here the basic definition in general terms. Let the parameters $(\lambda,r)$ of the RGG be supercritical for the almost-sure existence of a random infinite connected component $\mathcal{H}$ . Note that the infinite component $\mathcal{H}$ is unique almost surely, and we define the FPP model on $\mathcal{H}$ with independent and identically distributed random variables on the joint probability space $(\Omega, \mathscr{A},\mathbb{P})$ .

The aim of this paper is to investigate the $\mathbb{P}$ almost sure existence of the limiting shape of the above-defined process. In fact, we show that, under some conditions, the random balls of $\mathcal{H}$ converge $\mathbb{P}$ almost surely (a.s.) to the deterministic shape of a Euclidean ball. The additional conditions refer to the distribution of zero passage time on the edges and the at least linear growth of the process.

The model will be formally defined in the next sections; we first give a simplified description of the process to state the main result. Let $\tau$ be a random variable which defines the common distribution of the independent and identically distributed passage times $\tau_e$ along each edge $e \in E(\mathcal{H})$ .

Set $ {r}_{\text{c}}(\lambda)>0$ to be the critical $ {r}$ for the existence of the infinite connected component $\mathcal{H}$ of the RGG $\mathcal{G}_{\lambda,r}$ . Let $B_s(x)$ stand for the open Euclidean ball of radius $s \geq 0$ centered at $x \in \mathbb{R}^d$ , and denote by $\upsilon_d$ be volume of the unit ball in d-dimensional Euclidean space. Denote by $H_t$ the random subset of $\mathbb{R}^d$ of points for which their closest point in $\mathcal{H}$ is reached by the FPP model up to time $t>0$ . We let $H_0$ be the set of points that have the same closest point in $\mathcal{H}$ as the origin. Here is our first main theorem.

Theorem 1.1. (Shape theorem for FPP on RGGs.) Let $d \geq 2$ and $ {r}> {r}_{\text{c}}(\lambda)$ . Consider the FPP with i.i.d. random variables defined on the infinite connected component $\mathcal{H}$ of $\mathcal{G}_{\lambda,r}$ . Suppose that the following conditions are satisfied:

  • A 1 $\mathbb{P}(\tau=0) < {1}/({\upsilon_d {r}^d \lambda})$ .

  • A 2 There exists $\eta>2d+2$ such that $\mathbb{E}[\tau^\eta] < +\infty$ .

Then, there exists $\unicode{x03C6} \in (0, +\infty)$ such that, for all $\varepsilon \in (0,1)$ , $\mathbb{P}$ -a.s., $(1-\varepsilon) B_{\unicode{x03C6}}(o) \subseteq ({1}/{n})H_{n} \subseteq (1+\varepsilon) B_{\unicode{x03C6}}(o)$ for sufficiently large $n \in \mathbb{N}$ .

The existence of the limiting shape is particularly interesting because the RGG is a random graph which exhibits unbounded holes and unbounded degrees. To avoid the possible extreme effects of such pathologies on the growth of the process, we control the growth almost surely by combining the conditions above with properties of the point process.

The interest in applications for this class of models has already been pointed out in [Reference Jahnel and König6], which, in particular, suggests the theorem for the Richardson model on telecommunication networks. The example is naturally associated with the contact process by stochastic domination as studied in [Reference Ménard and Singh10, Reference Riblet14]. Another interesting application is a lower bound for the critical probability of bond percolation on the RGG. The same lower bound can be obtained by other methods (e.g. branching processes); however, it shows in comparison how good and suitable condition A1 is.

It is worth pointing out that a bigger class of random geometric graphs was studied in [Reference Hirsch, Neuhäuser, Gloaguen and Schmidt5] where the graph distance was interpreted as an FPP model. This suggests that the class of RGGs could also be expanded in our case. We chose to focus our attention on the standard definition in this work due to the usage of intermediate results presented in the next section.

Before we state our second main result, let us present some examples.

Figure 1. Simulation of the open clusters for a bond percolation model on a two-dimensional RGG with $p<1/(\upsilon_d {r}^d\lambda)$ .

Example 1.1. (Bond percolation.) We define bond percolation by considering the clusters of the Bernoulli FPP only at time zero; see Fig. 1 for an illustration. For this, let us call $e \in E(\mathcal{H})$ an open edge when $\tau_e =0$ . Set $\tau_e \sim \operatorname{Ber}(1-p)$ independently for every $e \in E(\mathcal{H})$ , and observe that condition A2 is immediately satisfied.

Then, the open clusters are maximally connected components defined by sites with passage time zero between them. Let us define the critical probability $p_{\text{c}}$ for the bond percolation on the d-dimensional RGG by

\[ p_{\text{c}} \,:\!=\, \inf\{p \in [0,1]\,:\, \mathbb{P}(\text{there exists an infinite open cluster in } \mathcal{H})>0, \tau_e \sim \operatorname{Ber}(1-p)\}. \]

Note that, by Theorem 1.1, the case $p< 1/\big(\upsilon_d {r}^d \lambda\big)$ implies the existence of the limiting shape. Thus, an immediate consequence of the theorem is the lower bound for the critical probability $p_{\text{c}} \geq 1/\big(\upsilon_d {r}^d\lambda\big)$ , and for $p=0$ we recover $\mathcal{H}$ . We observe that the same lower bound can also be obtained by exploration methods.

Figure 2. Simulation of the spread of an infection given by the Richardson model on a bidimensional RGG.

Example 1.2. (Richardson’s growth model.) Consider the interacting particle system known as the Richardson model defined on the infinite connected component $\mathcal{H}$ of the RGG with parameter $\lambda_{\rm I}>0$ . It is a random growth process based on a model introduced in [Reference Richardson15] and illustrated in Fig. 2. It is commonly referred to as a model for the spread of an infection or for the growth of a population.

At each time $t \geq 0$ , a site of $\mathcal{H}$ is in either of two states, healthy (vacant) or infected (occupied). Let $\zeta_t\,:\, V(\mathcal{H})\to \{0,1\}$ indicate the state of the sites at time t, assigning the values 0 and 1 for the healthy and infected states, respectively. The process evolves as follows:

  • A healthy particle becomes infected at rate $\lambda_{\rm I}\sum_{y \sim x}\zeta_t(y)$ .

  • An infected particle remains infected forever.

It is easily seen that the process is determined by FPP with edge passage times $\tau_e \sim \text{Exp}(\lambda_{\rm I})$ independently for each $e \in E(\mathcal{H})$ . In particular, this version of the Richardson model conventionally stochastically dominates the basic contact process.

Conditions A1 and A2 are straightforward since $\mathbb{P}(\tau=0)=0<1/\big(\upsilon_d {r}^d\lambda\big)$ and since $\mathbb{E}[\!\exp\!(\alpha\tau)] < +\infty$ for $\alpha \in (0, \lambda_{\rm I})$ . Hence, Theorem 1.1 is valid for the Richardson model on $\mathcal{H}$ for any supercritical $ {r} > {r}_{\text{c}}(\lambda)$ .

Futhermore, it is immediate to see that Theorem 1.1 still holds for any initial configuration $\text{Z} \subseteq \mathbb{R}^d$ of infected particles whenever $\text{Z} \subseteq B_{s^{\prime}}(o)$ for some $s^{\prime}>0$ . In that case, we simply replace $H_t$ by $H_t^\text{Z} \,:\!=\, \bigcup_{z \in \text{Z}}H_t^z$ .

Our second main result concerns the asymptotic behavior of the Richardson model in the limit as $\alpha$ diverges to infinity in $\alpha\lambda$ and $\lambda_{\rm I}/\alpha$ . In words, we consider a coupled limit of high densities and slow infection rates.

Indicating the parameters explicitly now, we write $\mathcal{H}_t^{\lambda,\lambda_\text{I}}$ for the set of points in $\mathcal{H}$ reached by the FPP model up to time $t > 0$ . As before, $\mathcal{H}_{0}^{\lambda, \lambda_{\rm I}}$ is the closest point in $\mathcal{H}$ to the origin, with $\mathcal{H}_0^{\lambda, \lambda_{\rm I}} = \emptyset$ if there is no infinite component.

The limiting process is a branching process $\big(\mathcal{T}^{\lambda,\lambda_{\rm I}}_t\big)_{t\ge 0}$ defined as follows. At time zero, the process has a node only at the origin, i.e. $\mathcal{T}^{\lambda,\lambda_{\rm I}}_0=o$ . Then, iteratively, each node $X_i\in \mathbb{R}^d$ of the process produces offspring independently according to a Poisson process in time with intensity $\upsilon_d r^d\lambda\lambda_{\rm I}$ , and the offspring are placed independently and uniformly within $B_r(X_i)$ . We note that this process has similarities with the growth process as presented in [Reference Deijfen2]. Our second main result follows.

Theorem 1.2. (Time–space rescaling for Richardson models.) Let $d\ge 2$ . For the Richardson model with parameters $ {r}$ , $\lambda$ , and $\lambda_{\rm I}$ , where $ {r} > {r}_{\rm c}(\lambda)$ , we have $\big(\mathcal{H}_{t}^{\alpha \lambda, \lambda_{\rm I}/\alpha}\big)_{t \ge 0} \rightarrow \big(\mathcal{T}^{\lambda, \lambda_{\rm I}}_{t}\big)_{t \ge 0}$ weakly with respect to the Skorokhod topology based on the weak topology, as $\alpha$ tends to infinity.

More details regarding the topologies involved in the above convergence are given in Section 4.

The rest of the manuscript is organized as follows. In Section 2 we have compiled some basic facts about RGGs and show results on the asymptotic behavior of the infinite component $\mathcal{H}$ . The FPP model is defined in detail in Section 3, where we also present the proof of Theorem 1.1. Finally, in Section 4 we present the proof of Theorem 1.2.

2. On the random geometric graph

In this section we present the definition and parameters for an RGG, and the existence of the infinite connected component. We also present some results about its geometry in order to study the asymptotic shape in the next section.

Let $\mathcal{P}_\lambda$ be the random set of points determined by the homogeneous PPP on $\mathbb{R}^d$ with intensity $\lambda>0$ . The RGG $\mathcal{G}_{\lambda,r}=(V,E)$ on $\mathbb{R}^d$ is defined by

\[ V = \mathcal{P}_\lambda, \qquad E = \big\{\{u,v\} \subseteq V\,:\, \|u-v\|< {r},\, u \neq v\big\},\]

where $\|\cdot\|$ is the Euclidean norm. Since $\lambda^{-1/d}\mathcal{P}_\lambda \sim \mathcal{P}_1$ , we may regard $\lambda$ as fixed due to the homogeneity of the norm. We write $\mathcal{G}_{ {r}} \,:\!=\, \mathcal{G}_{1, {r}}$ and $\mathcal{P}=\mathcal{P}_1$ . Set $(\Xi,\mathscr{F},\mu)$ to be the probability space induced by the construction of $\mathcal{P}$ . Let us now introduce the group action $\unicode{x03D1}\,:\,\mathbb{R}^d \curvearrowright\Xi$ determined by the spatial translation as a shift operator. That is, $\mathcal{P}\circ\unicode{x03D1}_z = \{v-z \,:\, v \in \mathcal{P}\}$ . The following lemma is a classical result on PPPs, which can be found, for example, in [Reference Meester and Roy9, Proposition 2.6].

Lemma 2.1. The homogeneous PPP is mixing on $(\Xi,\mathscr{F},\mu,\unicode{x03D1})$ .

Remark 2.1. Let $S\,:\,\mathbb{R}^d\to\mathbb{R}^d$ be an isometry. Then, it is known that S induces a $\mu$ -preserving ergodic function $\sigma\,:\, \Xi \to \Xi$ where $S[\mathcal{P}] = \mathcal{P} \circ \sigma$ .

We are interested in studying the spread of an infection on an infinite connected component of $\mathcal{G}_{ {r}}$ . It is a well-known fact from continuum percolation theory (see [Reference Meester and Roy9] or [Reference Penrose11, Chapter 10] for details) that, for all $d \geq 2$ , there exists a critical $ {r}_{\text{c}}>0$ such that $\mathcal{G}_{ {r}}$ has an infinite component $\mathcal{H}$ $\mu$ -a.s. for all $ {r}> {r}_{\text{c}}$ . Moreover, $\mathcal{H}$ is $\mu$ -a.s. unique. Since $\mathcal{H}$ is a subgraph of $\mathcal{G}_{ {r}}$ , we denote by $V(\mathcal{H})$ and $E(\mathcal{H})$ its sets of vertices and edges, respectively.

From now on, we write $(\Xi^{\prime},\mathscr{F}^{\prime},\mu)$ for the probability space of the PPP conditioned on the existence of $\mathcal{H}$ when $ {r}> {r}_{\text{c}}$ . It suffices for our purposes to know that $ {r}_{\text{c}}\geq 1/{\upsilon_d}^{1/d}$ , where $\upsilon_d$ denotes the volume of the unit ball in the d-dimensional Euclidean space. Indeed, improved lower and upper bounds can be found in [Reference Torquato and Jiao17], and $ {r}_{\text{c}}$ approximates to $1/{\upsilon_d}^{1/d}$ from above as $d \to +\infty$ .

Let us write $\theta_{ {r}} \,:\!=\, \mu ( B_{ {r}}(o) \cap V(\mathcal{H}) \neq \emptyset)$ and denote the cardinality of a set by $|\cdot|$ .

Proposition 2.1. (Weaker version of [Reference Penrose and Pisztora12, Theorem 1].) Let $d \geq 2$ , $ {r}> {r}_{\text{c}}$ , and $\varepsilon \in (0,1/2)$ . Then, there exist $c>0$ and $s_0>0$ such that, for all $s \geq s_0$ ,

\[ \mu\bigg((1-\varepsilon)\theta_{ {r}} < \frac{|V(\mathcal{H}) \cap [{-}s/2,s/2]^d |}{s^d} < (1+\varepsilon)\theta_{ {r}} \bigg) \geq 1 -\exp\big({-}cs^{d-1}\big). \]

As a consequence of the last result, we present the following lemma without proof (see [Reference Yao, Chen and Guo18, Lemma 3.3]).

Lemma 2.2. Let $ {r}> {r}_{\text{c}}$ . Then there exist $C,C^{\prime}>0$ such that, for each $x \in \mathbb{R}^d$ and all $s>0$ , $\mu\big(B_s(x) \cap V(\mathcal{H})= \emptyset\big) \leq C\exp\big({-}C^{\prime}s^{d-1}\big)$ .

Let $\mathscr{P}(x,y)$ denote the set of self-avoiding paths from x to y in $\mathcal{H}$ . The simple length of a path $\gamma = (x=x_0, x_1, \dots, x_m=y) \in \mathscr{P}(x,y)$ is denoted by $|\gamma|=m$ .

Write $\text{D}(x,y)$ for the $\mathcal{H}$ -distance between $x,y \in V(\mathcal{H})$ given by $\text{D}(x,y) = \inf\{|\gamma|\,:\,\gamma \in \mathscr{P}(x,y)\}$ .

Let $x \in \mathbb{R}^d$ ; then we define $q\,:\, \mathbb{R}^d \to V(\mathcal{H})$ by

(2.1) \begin{equation} q(x) \,:\!=\, \mathop{\text{arg min}}\limits_{y \in V(\mathcal{H})}\{\|y-x\|\},\end{equation}

the closest point to x in the infinity cluster. Observe from (2.1) that q may be multivalued for some $x \in \mathbb{R}^d$ . In that case, we assume that q(x) is uniquely defined by an arbitrarily fixed outcome of (2.1). Hence, q induces a Voronoi partition of $\mathbb{R}^d$ with respect to $\mathcal{H}$ ; see Fig. 3 for an illustration.

Figure 3. A random geometric graph on $\mathbb{R}^2$ with the Voronoi partition generated by the infinite connected component $\mathcal{H}$ (in blue).

We now extend the domain of the $\mathcal{H}$ -distance by defining $\text{D}(x,y)\,:\!=\,\text{D}(q(x),q(y))$ for every $x,y \in \mathbb{R}^d$ . The following proposition can be immediately adapted from the proof of [Reference Yao, Chen and Guo18, Theorem 2.2] by applying properties of Palm calculus and Lemma 2.2

Proposition 2.2. (Adapted from [Reference Yao, Chen and Guo18, Theorem 2.2].) Let $d \geq 2$ and $ {r}> {r}_{\text{c}}$ . Then there exists $\rho_{ {r}} > 0$ depending on $ {r}$ such that, $\mu$ -a.s. for all $x \in \mathbb{R}^d$ ,

\[ \lim_{\substack{\|y\|\uparrow + \infty}}\frac{\text{D}(x,y)}{\|y-x\|} = \rho_{ {r}}. \]

The constant $\rho_{ {r}}$ is called the stretch factor of $\mathcal{H}$ . Observe that $\rho_{ {r}} \geq 1/ {r}$ . Due to the subadditivity of the $\mathcal{H}$ -distance, we can easily see that $\mathbb{E}_\mu[\text{D}(o, z)]$ with $\|z\|=1$ is an upper bound for $\rho_{ {r}}$ .

We have the following result about the tail behavior of $\text{D}(o, z)$ .

Lemma 2.3. Let $d \geq 2$ and $ {r}> {r}_{\text{c}}$ . Then there exist $c_1,c_2>0$ and $\beta^{\prime} >1$ such that, for all $x \in \mathbb{R}^d$ and every $t > \beta^{\prime}\|x\|$ , $\mu(\text{D}(o,x) \geq t) \leq c_1\exp({-}c_2 t)$ .

Proof. Let us write $\mu_{v,w}$ for the Palm measure $\mu \ast \delta_v \ast \delta_w$ for any given $v,w \in \mathbb{R}^d$ . Set $\overline{\text{D}}$ to be the simple $\mathcal{G}_{ {r}}$ -distance. In what follows, $v \leftrightsquigarrow w$ represents the existence of a path between v and w in $\mathcal{G}_{ {r}}$ . It is clear that $\text{D}(v,w)=\overline{\text{D}}(v,w)$ whenever $v,w\in V(\mathcal{H})$ . By [Reference Yao, Chen and Guo18, Lemma 3.4], there exist $\overline{c}_1,\overline{c}_2>0$ and $\beta^{\prime}>1$ such that

(2.2) \begin{equation} \mu_{v,w} \big(v \leftrightsquigarrow w \text{ and } \overline{\text{D}}(v,w) \geq t\big) \leq \overline{c}_1 \exp({-}\overline{c}_2t) \end{equation}

for all $t \geq \beta^{\prime} \|v-w\|/2$ . Consider now $\mathcal{B}_r(z)\,:\!=\, B_r(z) \cap \mathcal{P}$ . We apply Lemma 2.2, (2.2), and Campbell’s theorem to obtain that there exist $C,C^{\prime}>0$ such that

\begin{align*} \mu\big(\text{D}(o,x) \geq t\big) & \leq \mu(\|q(o)\| \geq t/(2\beta^{\prime})) + \mu(\|q(x)-x\| \geq t/(2\beta^{\prime})) \\ & \quad + \mu\Bigg(\bigcup_{\substack{v \in \mathcal{B}_{t/(2\beta^{\prime})}(o), \, w \in \mathcal{B}_{t/(2\beta^{\prime})}(x)}} \{v \leftrightsquigarrow w \text{ and } \overline{\text{D}}(v,w) \geq t\}\Bigg) \\ & \leq 2 C \exp({-C^{\prime}t/(2\beta^{\prime})}) + \overline{c}_1\frac{\upsilon_d^2}{2^{2d}}t^{2d} \exp({-\overline{c}_2t}) \end{align*}

for all $t \geq \beta^{\prime} \|x\|$ . We conclude the proof by choosing suitable $c_1,c_2>0$ .

Next, let us define, for every $x \in \mathbb{R}^d$ , the quantity $W_n^x \,:\!=\, \{$ self-avoiding paths of length n in $\mathcal{G}_{ {r}}$ starting at $x\}$ and note that, using [Reference Jahnel and König6, Theorem 4.6.11]), we have $\mathbb{E}_\mu[|W_n^x|]=\big(\upsilon_dR^d\big)^n$ .

Consider now $\big|W_n^{q(o)}\big|$ , the number of self-avoiding paths in $\mathcal{H}$ starting at q(o). We apply the previous result to prove the following lemma.

Lemma 2.4. Let $d \geq 2$ , $ {r} > {r}_{\text{c}}$ , and $\unicode{x03BA}>1$ . Then we have, $\mu$ -a.s. for sufficiently large $n \in \mathbb{N}$ , $\big|W_n^{q(o)}\big| < (\unicode{x03BA} \upsilon_d {r}^{d})^n$ .

Proof. Let $n\in\mathbb{N}$ and define the events $\textsf{A}_n \,:\!=\, \big\{|W_n^{q(o)}| \geq (\unicode{x03BA}\upsilon_d {r}^d)^n\big\}$ . Recall the notation $\mathcal{B}_n(o)\,:\!=\, B_n(o) \cap \mathcal{P}$ . Then

\[ \textsf{A}_n \subseteq \Bigg(\bigcup_{ v \in \mathcal{B}_n(o)} \big\{|W_n^{v}| \geq (\unicode{x03BA}\upsilon_d {r}^d)^n, \|q(o)\|< n \big\}\Bigg)\cup \{\|q(o)\| \geq n \}. \]

Hence, by Markov’s inequality, for any given $x \in \mathbb{R}^d$ ,

\[ \mu\big(|W_n^x| \geq (\unicode{x03BA}\upsilon_d {r}^d)^n\big) \leq \mathbb{E}_\mu \big[|W_n^x|\big]/(\unicode{x03BA}\upsilon_d {r}^d)^n = 1/\unicode{x03BA}^n. \]

Thus, by Lemma 2.2 and Campbell’s theorem, there exist $C,C^{\prime}>0$ such that

\[ \sum_{n=1}^{+\infty}\mu(\textsf{A}_n) \leq \upsilon_d\sum_{n=1}^{+\infty}\frac{n^d}{\unicode{x03BA}^n} + C\sum_{n=1}^{+\infty}{\text{e}^{-C^{\prime}n^{d-1}}} \lt +\infty, \]

and thus an application of the Borel–Cantelli lemma completes the proof.

3. First-passage percolation

We proceed to formally define our process. Let $\{\tau_e\}_{e \in E}$ be a family of independent and identically distributed random variables taking values in the time set $[0,+\infty)$ . We say that $\tau_e$ is the passage time of the edge $e \in E(\mathcal{H})$ .

Set $(\Omega, \mathscr{A}, \mathbb{P})$ to be the joint probability space associated with the construction of the random geometric graph $\mathcal{G}_{ {r}}$ and the independent assignment of the random passage times $\{\tau_e\}_{e\in E}$ . The joint probability space can be constructed as a product space and we will write $\mathbb{E}=\mathbb{E}_{\mathbb{P}}$ for short.

Given any path $\gamma=(x,x_1,\dots,x_m,y)\in \mathscr{P}(x,y)$ for $x,y \in V(\mathcal{H})$ , we write $e \in \gamma$ for an edge $e \in E(\mathcal{H})$ between a pair of consecutive vertices of $\gamma$ . We denote the passage time of the path $\gamma$ by $T(\gamma) \,:\!=\, \sum_{e \in \gamma}\tau_e$ . The passage time between $x,y \in \mathbb{R}^d$ is then defined by the random variable $T(x,y) \,:\!=\, \inf\{ T(\gamma) \,:\, \gamma\in \mathscr{P}(q(x),q(y))\}$ . In fact, we see later that T(x, y) is a random pseudo-metric when associated with a group action. To avoid cumbersome notation, we set $T(x)\,:\!=\, T(o,x)$ for all $x \in \mathbb{R}^d$ .

Using these definitions, we have $H_t \,:\!=\, \{x \in \mathbb{R}^d\,:\, T(x) \leq t\}$ for the set of Voronoi cells induced by $\mathcal{H}$ reached up to time t with the FPP starting in q(o).

Next, consider $\unicode{x03D1}\,:\, \mathbb{R}^d \curvearrowright \Omega$ to be an extension of the group action introduced in Section 2 such that $\unicode{x03D1}_z$ will induce $\tau_{\{x,y\}} \mapsto \tau_{\{x-z,y-z\}}$ independently in the product space. It is easily seen that $\unicode{x03D1}$ inherits the ergodic property of the previously defined group action and that Remark 2.1 still holds for actions on $\Omega$ associated with isometries by extending them in the same fashion. Then, we observe that $T(x,x+y)= T(y)\circ\unicode{x03D1}_x$ , and that the subadditivity

(3.1) \begin{equation} T(x+y) \leq T(x) + T(y)\circ\unicode{x03D1}_x,\end{equation}

for all $x,y \in \mathbb{R}^d$ , is straightforward.

We have the following lemma.

Lemma 3.1. Let $d \geq 2$ , $ {r}> {r}_{\text{c}}$ , and $\mathbb{P}(\tau=0) < 1/(\upsilon_d {r}^d)$ . Then there exists $a>0$ depending on $ {r}$ such that, for all $x \in \mathbb{R}^d$ , $a \|x\| \leq \mathbb{E}[T(x)]$ .

Proof. It suffices to prove this statement for large $\|x\|$ as, due to the subadditivity (3.1) and stationarity of $T(nx,(n+1)x)$ for all $n \in \mathbb{N}$ , we have

\[ {\mathbb{E}[T(mx)]}/{\|mx\|} \le \sum_{i=1}^m \mathbb{E}[T((i-1)x,ix)]/\|mx\| = {\mathbb{E}[T(x)]}/{\|x\|}. \]

Define the event $A^1_x\,:\!=\, \{\max\{\|q(o)\|,\|q(x)-x\|\} \le {\|x\|}/4\}$ . In order to simplify the notation, let us abbreviate $m_x=\lceil\|x\|/(2 {r})\rceil$ . Note that on $A^1_x$ , every path $\gamma \in \mathscr{P}\big(q(o),q(x)\big)$ has $|\gamma| \ge m_x$ and therefore includes a subpath of length at least $m_x$ . Consequently, for any $t>0$ ,

\begin{equation*} \mathbb{P}(\{T(x) \le t\} \cap A^1_x) = \mathbb{P}\Bigg(\Bigg\{ \inf_{\gamma \in \mathscr{P}\big(q(o),q(x)\big)} T(\gamma)\le t \Bigg\}\cap A^1_x \Bigg) \le \mathbb{P}\Bigg(\inf_{\gamma \in W_{m_x}^{q(o)}} T(\gamma) \le t\Bigg). \end{equation*}

In order to proceed, we first observe that, using Chernoff’s bound for the binomial distribution with $X \sim \text{Binomial}(n,p)$ , we have

\begin{equation*} \mathbb{P}(X\le cn) \le \exp\bigg({-}n\bigg(c \log \frac{c}{p} + (1-c)\log\frac{1-c}{1-p}\bigg)\bigg) = \big(p^{-c} (1-p)^{-(1-c)} \cdot c^{c} (1-c)^{(1-c)}\big)^{-n}, \end{equation*}

where for $c \rightarrow 0$ the base converges to $(1-p)^{-1}$ . Also, because of the right continuity of the cumulative distribution function associated to $\tau$ , there exist $\unicode{x03BA}>1$ and $\delta>0$ such that $\mathbb{P}(\tau\leq \delta) < 1/\big(\unicode{x03BA} \upsilon_d {r}^d\big)$ . Further, consider a random variable $X^{\prime} \sim \text{Binomial}(n,\mathbb{P}(\tau>\delta))$ with respect to $\mathbb{P}$ .

Note that $\tau \ge \delta \textbf{1}\{\tau > \delta\}$ , and therefore on any self-avoiding path of length $|\gamma|=n$ the sum of n i.i.d. copies of $\tau$ stochastically dominates $\delta X^{\prime}$ .

Therefore, there exists $c>0$ and $\unicode{x03BA}^{\prime}>1$ such that, for all $n\in \mathbb{N}$ and $|\gamma| = n$ ,

\[ \mathbb{P}(T(\gamma) \le cn) \le \mathbb{P}(X^{\prime} > cn / \delta ) \leq \big(\unicode{x03BA}^{\prime} \upsilon_d {r}^d\big)^{-n}. \]

Fix $1<\unicode{x03BA}^{\prime\prime}<\unicode{x03BA}^{\prime}$ and define $A^2_x \,:\!=\, \big\{\big|W_{m_x}^{q(o)}\big| \le \big(\unicode{x03BA}^{\prime\prime}\upsilon_d {r}^d\big)^{m_x}\big\}$ and $A_{x} \,:\!=\, A^1_x \cap A^2_x$ . Then, we have

\begin{align*} \mathbb{P}\left(T(x) \le cm_x\right) & \le \mathbb{P}((A_x)^\text{c}) + \mathbb{P}\Bigg({A_x} \cap \Bigg\{{{\inf_{\gamma \in W_{m_x}^{q(o)}}}} T(\gamma) \le cm_x\Bigg\}\Bigg) \\ & \le \mathbb{P}((A_x)^\text{c}) + \mathbb{E}\Bigg[\textbf{1}_{A_x} \cdot \sum_{\gamma \in W_{m_x}^{q(o)}} \textbf{1}\{T(\gamma) \le cm_x\}\Bigg] \\ & \le \mathbb{P}((A_x)^\text{c}) + \big(\unicode{x03BA}^{\prime\prime}\upsilon_d {r}^d\big)^{m_x} \cdot \big(\unicode{x03BA}^{\prime} \upsilon_d {r}^d\big)^{-m_x}, \end{align*}

where $\mathbb{P}((A_x)^\text{c})$ can be made arbitrarily small by choosing $\|x\|$ large enough via Lemmas 2.2 and 2.4. As $\unicode{x03BA}^{\prime\prime} < \unicode{x03BA}^{\prime}$ , the exponent in the second summand is negative and dominates the polynomial term for large x. Therefore, there is a k such that, for all $x \in \mathbb{R}^d$ with $\|x\|\geq k$ , $\mathbb{P}(T(x) \leq cm_x) \leq \frac12$ . Setting $a = c/4 {r}$ we arrive at the statement $a\|x\| \leq \mathbb{E}[T(x)]$ when $\|x\| >k$ .

Remark 3.1. Observe that $\mathbb{E}[T(x)] \leq \mathbb{E}[\text{D}(o,x)]\mathbb{E}[\tau]$ due to the subadditivity and Fubini’s theorem. Moreover, condition A2 implies that $\mathbb{E}[\tau] < +\infty$ . We can easily see from Proposition 2.2 and the $L^1$ convergence given by Kingman’s subadditive ergodic theorem [Reference Kingman8] applied to the $\mathcal{H}$ -distance, that, for all $x \in \mathbb{R}^d$ ,

\[ b\,:\!=\, \rho_{ {r}}\mathbb{E}[\tau] \geq \limsup_{n \uparrow +\infty} \mathbb{E}[T(nx)]/\|nx\|. \]

Denote by $\mathbb{P}_\xi$ the quenched probability of the propagation model given a realization $\xi \in \Xi^{\prime}$ . The following lemma ensures the at least linear growth of the passage times.

Lemma 3.2. Let $d \geq 2$ , $ {r}> {r}_{\text{c}}$ , and assume that condition A2 holds. Then there exist deterministic $\beta>0$ and $\unicode{x03BA}>1$ such that, for every $x,y \in \mathbb{R}^d$ and for each $\xi \in \Xi^{\prime}$ , $\mathbb{P}_{\xi}(T(x,y) \geq t) \leq t^{-(d+\unicode{x03BA})}$ for all $t \geq \beta \text{D}(x,y)$ .

Proof. Let $\gamma \in \mathscr{P}(x,y)(\xi)$ be a geodesic given by the $\mathcal{H}$ -distance. Then, by Markov’s inequality, for $t > \mathbb{E}[\tau]\text{D}(x,y)$ and $\eta$ from condition A2,

(3.2) \begin{equation} \mathbb{P}_\xi( T(x,y) \geq t) \leq \mathbb{P}_\xi(T(\gamma) \geq t) \leq \frac{\mathbb{E}_{\xi}\big[\big(\sum_{e \in \gamma}(\tau_e - \mathbb{E}[\tau])\big)^\eta\big]}{(t - \mathbb{E}[\tau]\text{D}(x,y))^\eta}. \end{equation}

Rosenthal’s inequality [Reference Rosenthal16] states that, if $Y_1,\ldots,Y_n$ are independent random variables with mean zero and finite moment of order $p > 2$ , then

\[ \mathbb{E}\Bigg[\Bigg(\sum_{i=1}^n Y_i\Bigg)^p\Bigg] \le C_p \cdot \max\Bigg\{\sum_{i=1}^n\mathbb{E}[|Y_i|^p]\,;\;\Bigg(\sum_{i=1}^n \mathbb{E}[(Y_i)^2]\Bigg)^{p/2}\Bigg\}, \]

where $C_p > 0$ is a constant that depends only on p. Since condition A2 holds and $(\tau_e-\mathbb{E}[\tau_e])$ are identically distributed for all $e \in \gamma$ , this yields

(3.3) \begin{equation} \mathbb{E}_{\xi}\Bigg[\Bigg(\sum_{e \in \gamma} (\tau_e-\mathbb{E}[\tau])\Bigg)^\eta\Bigg] \le C\text{D}(x,y)^{\eta/2}, \end{equation}

where C is now a constant that depends both on $\eta$ and on the distribution of the random variables.

In the case $t \ge 2\mathbb{E}[\tau]\, \text{D}(x,y)$ we have $t-\mathbb{E}[\tau]\, \text{D}(x,y) \ge t/2$ . Using this and (3.3), the right-hand side of (3.2) is smaller than $2^\eta C \text{D}(x,y)^{\eta/2}t^{-\eta}$ . If we also have $t \ge 4 C^{2/\eta} \text{D}(x,y)$ , this is smaller than $t^{-\eta/2}$ . We have thus proved that $\mathbb{P}_{\xi}(T(x,y) \geq t) \leq t^{-(d+\unicode{x03BA})}$ for all $t \ge \beta \text{D}(x,y)$ , with $\beta \,:\!=\, \max\{2\mathbb{E}[\tau], 4 C^{2/\eta}\}$ and $\unicode{x03BA} \,:\!=\, \eta/2-d>1$ .

Before proving our first main theorem, we state and prove the following result. It is an annealed version of the at least linear growth from the lemma above in all directions.

Lemma 3.3. Let $d \geq 2$ and $ {r}> {r}_{\text{c}}$ . Consider the i.i.d. FPP on the RGG satisfying condition A2. Then, there exist constants $\delta, C > 0$ and $\unicode{x03BA}>1$ such that, for all $t>0$ and all $x \in \mathbb{R}^d$ ,

\[ \mathbb{P}\Bigg(\sup_{y \in B_{\delta t}(x)} T(x,y) \ge t\Bigg) \le C t^{-\unicode{x03BA}}. \]

Proof. Due to the translation invariance it suffices to prove the lemma for $x = 0$ . Let $\delta=(\beta^{\prime}\beta)^{-1}$ with $\beta^{\prime}$ and $\beta$ from Lemmas 2.3 and 3.2. Set $c_d>0$ to be such that $B_{2\delta}(o) \subseteq [{-}c_d/2,c_d/2]^d$ , and write $C_d\,:\!=\, 2 \theta_{ {r}} c_d$ with $\theta_{ {r}}>0$ from Proposition 2.1. Let us now define the following events:

\begin{align*} G_1 &\,:\!=\, \{q(o) \in B_{\delta t}(o)\} \cap \big\{|B_{\delta 2t}(o) \cap V(\mathcal{H})| \le C_d \cdot t^d\big\}, \\ G_2 &\,:\!=\, \Bigg\{\sup_{\|y\| \le \delta t} \text{D}(o,y) \le t/ \beta\Bigg\}\cap G_1, \\ G_3 &\,:\!=\, \Bigg\{\sup_{\|y\| \le \delta t} T(o,y) \ge t\Bigg\} \cap G_1 \cap G_2. \end{align*}

Now,

(3.4) \begin{equation} \mathbb{P}\Bigg(\sup_{y \in B_{\delta t}(o)} T(o,y) \ge t\Bigg) \le \mathbb{P}(G_3) + \mathbb{P}\big(G_1^{\text{c}}\big) + \mathbb{P}\big(G_2^{\text{c}}\big), \end{equation}

where the last two summands decrease exponentially in t due to Proposition 2.1 and Lemmas 2.2 and 2.3. By Lemma 3.2, there exists $\unicode{x03BA}>1$ such that

\begin{equation*} \mathbb{P}(G_3) \le \mathbb{E} \Bigg[\textbf{1}\{\xi\in G_1 \cap G_2\} \mathbb{P}_{\xi}\Bigg(\sup_{\|y\| < \delta t} T(y) \ge t\Bigg) \Bigg] \le C_d t^d/t^{d+\unicode{x03BA}}. \end{equation*}

Combining this with (3.4), the desired bound is obtained by choosing a suitable ${C>0}$ .

After this preparatory work, we now proceed to prove Theorem 1.1. The methods are closely related to standard techniques for shape theorems which can be found in [Reference Kesten7], for instance.

Proof of Theorem 1.1.We begin by verifying properties of T(nx). Note that, for every $x \in \mathbb{R}^d$ , $\mathbb{E}[T(x)] < +\infty$ by Lemmas 2.3 and 3.2. Recall that the process is mixing on $(\Omega, \mathscr{A},\mathbb{P},\unicode{x03D1})$ by Lemma 2.1. Then, by the subadditivity (3.1), we apply Kingman’s subadditive ergodic theorem to obtain that, $\mathbb{P}$ -a.s. for all $x \in \mathbb{R}^d$ ,

(3.5) \begin{equation} \lim_{n\uparrow+\infty}\frac{T(nx)}{n} = \phi (x), \end{equation}

where $\phi\,:\,\mathbb{R}^d\to [0,+\infty)$ is a homogeneous and subadditive function given by

\[ \phi(x) = \inf_{n\geq 1} \frac{\mathbb{E}[T(nx)]}{n} = \lim_{n\uparrow+\infty} \frac{\mathbb{E}[T(nx)]}{n}. \]

Since the process is rotation invariant, there exists a constant $\unicode{x03C6}$ (the time constant) such that $\phi(x)=\unicode{x03C6}^{-1}\|x\|$ for all $x \in \mathbb{R}^d$ . In fact, from Lemma 3.1 and Remark 3.1,

\[ 0<a \leq \unicode{x03C6}^{-1} \leq b= \rho_{ {r}}\mathbb{E}[\tau] < +\infty. \]

Let us now prove the $\mathbb{P}$ almost sure asymptotic equivalence

(3.6) \begin{equation} \lim_{\|y\|\uparrow+\infty} \frac{T(y)}{\|y\|} = \frac{1}{\unicode{x03C6}}. \end{equation}

For the approach from below, we prove the equivalent statement that, for every $\epsilon \in (0,1)$ ,

\[ \limsup_{s \uparrow +\infty}\Bigg(\sup_{\| y \| \le (1-\epsilon)s}\frac{T(y)}{s}\Bigg) = \limsup_{m \in \mathbb{N} ,m \uparrow +\infty}\Bigg(\sup_{\| y \| \le (1-\epsilon)m}\frac{T(y)}{m}\Bigg) \le \frac{1}{\unicode{x03C6}} \qquad \mathbb{P}-\text{a.s.}, \]

where the first equation holds as $\lfloor s \rfloor/s$ converges to 1. Fix $\epsilon \in (0,1)$ and let $\delta$ be given by Lemma 3.3. Due to compactness, there exists a finite cover of open balls with centers $(y_i)_{i \in \{1,\dots,n\}} \subseteq \mathbb{R}^d$ with $\|y_i\| \le 1-\epsilon$ such that

\[ \overline{B_{1 - \epsilon}(o)} \subseteq \bigcup_{{i \in \{1,\dots,n}\}} B_{\delta\epsilon/(2\unicode{x03C6})}(y_i). \]

Furthermore, $B_{m(1-\epsilon)}(o) \subseteq \bigcup_{{i \in \{1,\dots,n}\}} B_ {m\delta\epsilon/(2\unicode{x03C6})}(my_i)$ for every $m \in \mathbb{N}$ . Applying Lemma 3.3, we obtain

\[ \sum_{m \in \mathbb{N}}\mathbb{P}\Bigg(\sup_{\|y- my_i\| \le m \delta\epsilon/(2\unicode{x03C6})} T(m y_i, y) > m \epsilon/(2\unicode{x03C6}) \Bigg) < \infty. \]

Therefore, by the Borel–Cantelli lemma,

\[ \limsup_{m \in \mathbb{N}, m \uparrow +\infty} \Bigg(\sup_{\|my_i-y\| \le m \delta\epsilon/(2\unicode{x03C6})}\frac{T(my_i,y)}{m}\Bigg) < \frac{\epsilon}{2\unicode{x03C6}} \qquad \mathbb{P}-\text{a.s.} \]

Applying (3.5) and subadditivity, we obtain

\begin{align*} \limsup_{m \uparrow +\infty; \| y \| \le (1-\epsilon)m}\frac{T(y)}{m} & \le \limsup_{m \uparrow +\infty} \bigg(\max_{i \in \{1,\dots n\}} \frac{T(o,my_i)}{m} + \sup_{\|my_i-y\| \le m \delta\epsilon/(2\unicode{x03C6})} \frac{T(my_i,y)}{m}\bigg) \\ & \le \max_{i \in \{1,\dots, n\}}\|y_i\|/\unicode{x03C6} + \epsilon/(2\unicode{x03C6}) < 1/\unicode{x03C6} \qquad \mathbb{P}-\text{a.s.}, \end{align*}

where we used that $\|y_i\| < 1-\epsilon$ .

For the approach from above, define $A_t \,:\!=\, B_{t(1+2\epsilon)}(o) \setminus B_{t(1+\epsilon)}(o)$ and observe that it suffices to prove

\[ \liminf_{m \in \mathbb{N}, m \uparrow +\infty}\bigg(\inf_{y \in {A}_t}\frac{T(y)}{m}\bigg) \ge \frac{1}{\unicode{x03C6}} \qquad \mathbb{P}-\text{a.s.} \]

for arbitrary but fixed $\epsilon>0$ , as for $t > \epsilon$ and any x with $\|x\|>t(1+2\epsilon)$ there exists an $\tilde x \in A_t$ with $T(\tilde x) \le T(x)$ .

Similar to the approach from below, fix $\epsilon > 0$ and $\delta > 0$ small enough that Lemma 3.3 holds. There exists a set of centers $(y_i)_{i \in \{1,\dots,n\}} \subseteq \mathbb{R}^d$ with $\|y_i\| \ge 1+\epsilon$ such that $A_t \subseteq \bigcup_{{i \in \{1,\dots,n}\}} B_{\delta\epsilon/(2\unicode{x03C6})}(y_i)$ , and hence

\begin{align*} \liminf_{m\in \mathbb{N},m \uparrow +\infty}\bigg(\inf_{y \in {A}_m}\frac{T(y)}{m}\bigg) & \ge \liminf_{m\in \mathbb{N},m \uparrow +\infty} \bigg(\min_{i \in \{1,\dots n\}} \frac{T(o,my_i)}{m} - \sup_{\|my_i-y\| \le m \delta\epsilon/(2\unicode{x03C6})} \frac{T(my_i,y)}{m}\bigg) \\ & \ge \min_{i \in \{1,\dots n\}}\|y_i\|/\unicode{x03C6} - \epsilon/(2\unicode{x03C6}) > 1/\unicode{x03C6}, \end{align*}

which concludes the proof of the asymptotic equivalence in (3.6). The proof of the theorem is now complete by standard arguments of the $\mathbb{P}$ almost sure uniform convergence given by (3.6).

4. Proof of Theorem 1.2

Throughout this section, we fix r, $\lambda$ , and $\lambda_{\rm I}$ .

We start by giving some details on the topologies involved in the statement of Theorem 1.2, and introducing some notation.

Let $\mathcal{M}$ denote the space of measures of the form $\mu = \sum_{i=1}^k \delta_{\{z_i\}}$ , where $k \in \mathbb{N}_0$ and $z_1,\ldots, z_k \in \mathbb{R}^d$ are distinct. We endow this space with the weak topology, under which a sequence $\mu_n$ converges to $\mu$ if and only if $\int f\,\text{d}\mu_n \xrightarrow{n \to +\infty} \int f\,\text{d}\mu$ for all $f\,:\,\mathbb{R}^d \to \mathbb{R}$ that are continuous and bounded. This topology is metrizable; see [Reference Prokhorov13]. A sequence $\mu_n$ converges to $\mu = \sum_{i=1}^k \delta_{\{z_i\}}$ in this topology if and only if the following two conditions are satisfied: first, for n large enough, the total masses agree, i.e. $\mu_n(\mathbb{R}^d)=\mu(\mathbb{R}^d) = k$ , and second, we can take an enumeration (for n large enough) $\mu_n = \sum_{i=1}^k \delta_{\{z_{n,i}\}}$ so that $z_{n,i} \xrightarrow{n \to +\infty} z_i$ for each i.

We let $D_0$ be the space of all functions $\gamma\,:\,[0,\infty) \to \mathcal{M}$ of the form

\begin{equation*} \gamma(t) = \sum_{k=0}^ \infty \textbf{1}\{s_k\le t\}\delta_{\{z_k\}} ,\qquad t \ge 0,\end{equation*}

where $z_0,z_1,\ldots \in \mathbb{R}^d$ are distinct, $0=s_0 < s_1 < s_2 < \cdots$ , and $s_n \xrightarrow{n \to +\infty} \infty$ . For $\gamma$ of this form, we let $\phi_k(\gamma) = z_k$ , $k \ge 0$ , and $\psi_k(\gamma) = s_k - s_{k-1}$ , $k \ge 1$ . We endow $D_0$ with the Skorokhod topology; see [Reference Ethier and Kurtz3, Chapter 3]. Note that this gives rise to a topological subspace of the more usual space D of càdlàg functions; since the processes we are considering have constant-by-parts trajectories, it is more natural for us to work on $D_0$ than in D. By the definition of the Skorokhod topology, it is easy to see that

(4.1) \begin{align} & \gamma_n \xrightarrow{n \to +\infty} \gamma \quad \text{if and only if} \\ & \qquad \qquad \qquad \qquad \phi_k(\gamma_n) \xrightarrow{n \to +\infty} \phi_k \text{ for all } k \ge 0,\; \psi_k(\gamma_n) \xrightarrow{n \to +\infty} \psi_k(\gamma) \text{ for all } k \ge 1.\end{align}

Now let $\Lambda(\gamma) \,:\!=\, (\phi_0(\gamma),\phi_1(\gamma),\psi_1(\gamma),\phi_2(\gamma),\psi_2(\gamma),\ldots)$ , $\gamma \in D_0$ . Note that $\Lambda$ is a one-to-one mapping from $D_0$ to $\Lambda(D_0) \subset \mathbb{R}^d \times (\mathbb{R}^d \times (0,\infty))^\mathbb{N}$ . We endow $\Lambda(D_0)$ with the product topology (under which convergence means convergence in each coordinate, with respect to the Euclidean topology). With this choice, by (4.1), $\Lambda$ is a homeomorphism between $D_0$ and $\Lambda(D_0)$ .

We now return to the processes $\big(\mathcal{H}_{t}^{\alpha \lambda, \lambda_{\rm I}/\alpha}\big)_{t \ge 0}$ and $(\mathcal{T}_t^{\lambda,\lambda_\text{I}})_{t \ge 0}$ and note that, for any $t\ge 0$ , $\mathcal{H}_{t}^{\alpha \lambda, \lambda_{\rm I}/\alpha}$ can be written as $\sum_{z_i\in \mathcal{H}}\textbf{1}\{s_i\le t\}\delta_{\{z_i\}}$ , where $s_i$ is the (random) time at which the point $z_i$ is first reached in the FPP model. In particular, by Theorem 1.1, $\mathcal{H}_{t}^{\alpha \lambda, \lambda_{\rm I}/\alpha}\in\mathcal M$ and the same holds for $\mathcal{T}_t^{\lambda,\lambda_\text{I}}$ . Now, write $Z_{\alpha,k}\,:\!=\, \phi_k((\mathcal{H}^{\alpha \lambda, \lambda_\text{I}/\alpha}_t)_{t \ge 0})$ and $Z_k \,:\!=\, \phi_k((\mathcal{T}_t^{\lambda,\lambda_\text{I}})_{t \ge 0})$ for $k \ge 0$ , and note that $Z_{\alpha,0} = q(o)$ and $Z_0 = o$ . Also, write $T_{\alpha,0} = T_0 \,:\!=\, 0$ , $T_{\alpha,k}\,:\!=\, \psi_k((\mathcal{H}^{\alpha \lambda, \lambda_\text{I}/\alpha}_t)_{t \ge 0})$ , and $T_k \,:\!=\, \psi_k((\mathcal{T}_t^{\lambda,\lambda_\text{I}})_{t \ge 0})$ , $k \ge 1$ . With this notation, we can state the folllowing result.

Proposition 4.1. Let $k \in \mathbb{N}$ , $f_0,\ldots, f_k\,:\, \mathbb{R}^d \to \mathbb{R}$ , and $g_1,\ldots, g_k\,:\,(0,+\infty) \to \mathbb{R}$ ; assume all these functions are continuous with compact support. Then,

(4.2) \begin{equation} \mathbb{E}\Bigg[f_0(Z_{\alpha,0}) \prod_{i=1}^k f_i(Z_{\alpha,i})g_i(T_{\alpha,i})\Bigg] \xrightarrow{\alpha \to +\infty}f_0(o) \cdot \mathbb{E}\Bigg[\prod_{i=1}^k f_i(Z_{i})g_i(T_{i})\Bigg]. \end{equation}

We will prove this proposition later; for now, let us show how it implies Theorem 1.2.

Proof of Theorem 1.2.Proposition 4.1 and standard approximation arguments imply that, for all k,

\[(Z_{\alpha,0},Z_{\alpha,1},T_{\alpha,1},\ldots,Z_{\alpha,k},T_{\alpha,k}) \xrightarrow{\alpha \to +\infty} (Z_0,Z_1,T_1,\ldots Z_k,T_k)\]

in distribution. This implies that

(4.3) \begin{equation} (Z_{\alpha,0},Z_{\alpha,1},T_{\alpha,1},Z_{\alpha,2},T_{\alpha,2},\ldots) \xrightarrow{\alpha \to +\infty} (Z_0,Z_1,T_1,Z_2,T_2,\ldots) \end{equation}

in distribution, because convergence in distribution in the infinite product topology is equivalent to convergence of all finite-dimensional distributions. Given a function $h\,:\, D_0 \to \mathbb{R}$ that is continuous and bounded, we have

\begin{align*} \mathbb{E}\big[h\big(\big(\mathcal{H}_t^{\alpha \lambda,\lambda_\text{I}/\alpha}\big)_{t \ge 0}\big)\big]& = \mathbb{E}\big[h\big(\Lambda^{-1}\big(Z_{\alpha,0},Z_{\alpha,1},T_{\alpha,1},Z_{\alpha,2},T_{\alpha,2},\ldots\big)\big)\big] \\ & \quad \xrightarrow{\alpha \to +\infty} \mathbb{E}\big[h\big(\Lambda^{-1}\big(Z_0,Z_1,T_1,Z_2,T_2,\ldots\big)\big)\big] = \mathbb{E}\big[h\big(\big(\mathcal{T}_t^{\lambda,\lambda_\text{I}}\big)_{t \ge 0}\big)\big], \end{align*}

where the convergence follows from (4.3) and the fact that $h \circ \Lambda^{-1}$ is continuous and bounded. This proves that $\big(\mathcal{H}_t^{\alpha \lambda,\lambda_\text{I}/\alpha}\big)_{t \ge 0}$ converges to $\big(\mathcal{T}_t^{\lambda,\lambda_\text{I}}\big)_{t \ge 0}$ in distribution.

In order to prove Proposition 4.1, it is important to have a more explicit description of the expectations that appear in (4.2). To this end, let us give some definitions. Recall that $\mathcal{P}_{\alpha \lambda}$ denotes a PPP on $\mathbb{R}^d$ with intensity $\alpha \lambda$ ; we assume that this is the point process that gives rise to the infinite cluster in which the growth process $\big(\mathcal{H}_{t}^{\alpha \lambda, \lambda_{\rm I}/\alpha}\big)_{t \ge 0}$ is defined. Given a realization of $\mathcal{P}_{\alpha \lambda}$ and a finite set $S \subseteq \mathcal{P}_{\alpha\lambda}$ , define

\[ \mathcal{N}_\alpha(S) \,:\!=\, \sum_{x \in S} |(\mathcal{P}_{\alpha\lambda} \cap B_r(x) )\backslash S| = \sum_{y \in \mathcal{P}_{\alpha \lambda}\backslash S}|\{x \in S\,:\,\|x-y\|\le r\}|.\]

We now introduce probability kernels for each value of $\alpha$ ; these encode the jump rates of the dynamics of the growth process, conditioned on the realization of $\mathcal{P}_{\alpha\lambda}$ . We start with the temporal kernel

\[ \mathcal{L}_\alpha(S,\text{d}t) \,:\!=\, \frac{\mathcal{N}_\alpha(S)\lambda_{\rm I}}{\alpha} \cdot \exp\bigg({-}\frac{\mathcal{N}_\alpha(S)\lambda_{\rm I}}{\alpha}\cdot t\bigg)\,\text{d}t,\]

where S is any finite subset of $\mathcal{P}_{\alpha\lambda}$ and $\mathcal{L}_\alpha(S,\cdot)$ gives a measure on the Borel sets of $(0,\infty)$ , described above in terms of its density with respect to Lebesgue measure. Next, define the spatial kernel

\[ \mathcal{K}_\alpha(S,A) \,:\!=\, \frac{1}{\mathcal{N}_\alpha(S)} \cdot \sum_{y \in \mathcal{P}_{\alpha \lambda}\backslash S}|\{x \in S\,:\,\|x-y\|\le r\}|\cdot \delta_{\{y\}}(A),\]

where S is any finite subset of $\mathcal{P}_{\alpha\lambda}$ and A is a Borel subset of $\mathbb{R}^d$ , so that $\mathcal{K}_\alpha(S,\cdot)$ gives a probability measure on $\mathbb{R}^d$ . Finally, define the kernel $K_\alpha(S,\text{d}(x,t)) \,:\!=\, \mathcal{K}_\alpha(S,\text{d}x) \otimes \mathcal{L}_\alpha(S,\text{d}t)$ , i.e. $K_\alpha(S,\cdot)$ is the measure on $\mathbb{R}^d \times (0,+\infty)$ that satisfies, for any continuous functions $f\,:\,\mathbb{R}^d \to \mathbb{R}$ and $g\,:\,(0,+\infty) \to \mathbb{R}$ with compact support,

\[ \int_{\mathbb{R}^d\times(0,+\infty)} f(x)g(t)\,K_\alpha(S,\text{d}(x,t)) = \int_{\mathbb{R}^d} f(x)\,\mathcal{K}_\alpha(S,\text{d}x) \times \int_{(0,+\infty)} g(t)\,\mathcal{L}_\alpha(S,\text{d}t).\]

Now, using the strong Markov property, we can write

(4.4) \begin{align} \mathbb{E}\Bigg[f_0(Z_{\alpha,0})\prod_{i=1}^k & f_i(Z_{\alpha,i})g_i(T_{\alpha,i})\Bigg] \nonumber \\ & = \mathbb{E}\bigg[f_0(q(o)) \int K_\alpha(\{q(o)\},\text{d}(z_1,t_1)) f_1(z_1)g_1(t_1) \nonumber \\ & \qquad \quad \times \int K_\alpha(\{q(o),z_1\},\text{d}(z_2,t_2))f_2(z_2)g_2(t_2)\cdots \nonumber \\ & \qquad \quad \times \int K_\alpha(\{q(o),z_1,\ldots,z_{k-1}\},\text{d}(z_k,t_k)) f_k(z_k)g_k(t_k)\bigg]. \end{align}

We now define the analogous kernels for the limiting growth process. The temporal kernel is given by

\[ \mathcal{L}(S,\text{d}t) \,:\!=\, |S|\upsilon_dr^d\lambda \lambda_{\rm I} \cdot \exp\big({-} |S|\upsilon_dr^d\lambda \lambda_{\rm I} \cdot t\big)\, \text{d}t,\]

where $S \subseteq \mathbb{R}^d$ is finite, and again we obtain a measure on $(0,\infty)$ . Next, the spatial kernel is given by

\[ \mathcal{K}(S,\text{d}y) \,:\!=\, \bigg(\frac{1}{|S|\upsilon_dr^d} \sum_{x \in S} \textbf{1}\{y \in B_r(x)\}\bigg)\,\text{d}y \]

for $S \subseteq \mathbb{R}^d$ finite. So $\mathcal{K}(S,\cdot)$ is the probability measure on $\mathbb{R}^d$ obtained from first choosing $x \in S$ uniformly at random, and then choosing a point $y \in B_r(x)$ uniformly at random. We again let $K(S,\text{d}(x,t))\,:\!=\, \mathcal{K}(S,\text{d}x)\otimes \mathcal{L}(S,\text{d}t)$ . Again by the Markov property, the equality in (4.4) holds for the limiting process with respect to this kernel (that is, the same equality with q(o) replaced by o and all $\alpha$ s omitted).

The following is the essential ingredient in the proof of Proposition 4.1.

Lemma 4.1. Let $f\,:\,\mathbb{R}^d \to \mathbb{R}$ and $g\,:\,(0,+\infty) \to \mathbb{R}$ be continuous with compact support, $k\in \mathbb{N}$ , and $\varepsilon > 0$ . There exists $\alpha_0 > 0$ such that, for any $\alpha \ge \alpha_0$ , we have that, with probability larger than $1-\varepsilon$ , $\mathcal{P}_{\alpha\lambda}$ satisfies the following. For any set $S \subseteq B_{kr}(o) \cap \mathcal{P}_{\alpha\lambda}$ with $|S|\le k$ ,

\[ \bigg|\int_{\mathbb{R}^d}f(x) g(t)\,K_\alpha(S,\text{d}(x,t)) - \int_{\mathbb{R}^d}f(x) g(t)\,K(S,\text{d}(x,t))\bigg| < \varepsilon. \]

We postpone the proof of this lemma; it will immediately follow from Lemmas 4.3 and 4.4 below, which separately treat the spatial and temporal kernels. For now, let us show how Lemma 4.1 implies Proposition 4.1.

Proof of Proposition 4.1.We abbreviate

\[[K_\alpha fg](S) \,:\!=\, \int_{\mathbb{R}^d \times (0,+\infty)} f(x)g(t)\,K_\alpha(S,\text{d}(x,t)),\]

and also $S_{\alpha,k}\,:\!=\, \{Z_{\alpha,0},Z_{\alpha,1},\ldots, Z_{\alpha,k}\}$ , $k \in \mathbb{N}_0$ ; similarly when $\alpha$ is absent.

We proceed by induction on $k\in \mathbb{N}_0$ . We interpret the case $k = 0$ to mean that $\mathbb{E}[f_0(Z_{\alpha,0})] \xrightarrow{\alpha \to +\infty} f_0(0)$ , which holds because $Z_{\alpha,0}=q(o)$ converges in probability to o as $\alpha \to +\infty$ , as is easily seen. Now assume that the statement has been proved for $k-1 \ge 0$ , and take functions $f_1,\ldots, f_{k},g_1,\ldots, g_{k}$ as in the statement. It is convenient to add and subtract as follows (for $k=1$ , we interpret $\prod_{i=1}^0$ as being equal to one):

\begin{align*} \mathbb{E}\Bigg[f_0(Z_{\alpha,0}) \prod_{i=1}^{k-1} & f_i(Z_{\alpha,i})g_i(T_{\alpha,i})\Bigg] \\ & = \mathbb{E}\Bigg[f_0(Z_{\alpha,0})\prod_{i=1}^{k-1} f_i(Z_{\alpha,i})g_i(T_{\alpha,i}) \cdot [K_\alpha f_k g_k](S_{\alpha,k})\Bigg] \\ & = \mathbb{E}\Bigg[\prod_{i=1}^{k-1} f_i(Z_{\alpha,i})g_i(T_{\alpha,i}) \cdot ([K_\alpha f_{k}g_{k}](S_{\alpha,k})\pm [K f_{k}g_{k}](S_{\alpha,k}))\Bigg]. \end{align*}

Noting that the function that maps $(z_0,z_1,t_1,\ldots, z_{k-1},t_{k-1})$ into

\[f_0(z_0)\prod_{i=1}^{k-1}f_i(z_i)g_i(t_i)\cdot [Kf_kg_k](\{z_0,z_1,\ldots,z_{k-1}\}) \]

is continuous, the induction hypothesis and the definition of weak convergence give

\begin{align*} & \mathbb{E}\Bigg[f_0(Z_{\alpha,0}) \prod_{i=1}^{k-1} f_i(Z_{\alpha,i})g_i(T_{\alpha,i}) [K f_k g_k](S_{\alpha,k})\Bigg] \\ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, \quad \xrightarrow{\alpha \to +\infty} \mathbb{E}\Bigg[f_0(Z_0) \prod_{i=1}^{k-1} f_i(Z_{i})g_i(T_{i}) [K f_k g_k](S_{k})\Bigg] = \mathbb{E}\Bigg[f_0(Z_0) \prod_{i=1}^k f_i(Z_i)g_i(T_i)\Bigg]. \end{align*}

Next, we bound

\begin{align*} & \mathbb{E}\Bigg[f_0(Z_{\alpha,0}) \prod_{i=1}^{k-1} f_i(Z_{\alpha,i})g_i(T_{\alpha,i}) \cdot |[K_\alpha f_{k}g_{k}](S_{\alpha,k})- [K f_{k}g_{k}](S_{\alpha,k})|\Bigg] \\ &\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, \quad \le \bigg( \max_{i \le k-1} (\|f_i\|_\infty\vee \|g_i\|_\infty)\bigg)^{k} \cdot \mathbb{E}[ |[K_\alpha f_{k}g_{k}](S_{\alpha,k})- [K f_{k}g_{k}](S_{\alpha,k})|]. \end{align*}

By Lemma 4.1, the right-hand side converges to zero as $\alpha \to \infty$ . This completes the proof.

It remains to prove Lemma 4.1. To do so, let us now introduce some more notation. For each $\delta > 0$ , we define the collection of cubes $\mathcal{C}_\delta \,:\!=\, \{\delta z + [{-}{\delta}/{2},{\delta}/{2})^d\,:\, z \in \mathbb{Z}^d\}$ . Additionally, given $\alpha > 0$ , $\ell \in \mathbb{N}$ , and $\delta > 0$ , we define the event (involving the set $\mathcal{P}_{\alpha\lambda}$ , but not the passage times)

\[ \text{REG}_\alpha(\ell,\delta) \,:\!=\, \bigg\{\bigg|\frac{|\mathcal{P}_{\alpha\lambda} \cap Q|}{\alpha \lambda\delta^d} - 1\bigg| < \delta \text{ for all } Q \in \mathcal{C}_\delta \text{ with } Q \subseteq B_\ell(o)\bigg\}.\]

By the law of large numbers we have

(4.5) \begin{equation} \lim_{\alpha \to +\infty} \mathbb{P}(\text{REG}_\alpha(\ell,\delta)) = 1.\end{equation}

Lemma 4.2. For any $\varepsilon > 0$ and $k \in \mathbb{N}$ there exists $\delta_1 = \delta_1(\varepsilon,k)$ such that the following holds for $\delta \in (0,\delta_1]$ . For any $\ell \ge r$ , if $\alpha$ is large enough and the event $\text{REG}_\alpha(\ell+1,\delta)$ occurs, then, for any $S \subseteq\mathcal{P}_{\alpha\lambda}\cap B_{\ell-r}(o) $ with $|S| \le k$ ,

(4.6) \begin{equation}\sum_{x \in S}\sum_{Q\in \mathcal{C}_\delta} \bigg|\frac{|(\mathcal{P}_{\alpha\lambda}\cap Q \cap B_r(x) )\backslash S|}{\alpha \lambda} - \int_Q \textbf{1}\{\|y-x\| \le r\}\,\text{d}y\bigg| < \varepsilon. \end{equation}

Proof. It is not hard to see that we can choose $\delta^{\prime} > 0$ so that, for any $\delta < \delta^{\prime}$ ,

(4.7) \begin{equation} \delta^d\sup_{x \in \mathbb{R}^d} \sum_{Q \in \mathcal{C}_\delta} \textbf{1}\{Q \cap \partial B_r(x) \neq \varnothing\} < \frac{\varepsilon}{3k}, \end{equation}

where $\partial B_r(x)\,:\!=\, \{y \in \mathbb{R}^d\,:\,\|x-y\|= r\}$ . Next, we let $\delta_1\,:\!=\, \min\!(\delta^{\prime},\, {\varepsilon}/{2\upsilon_dr^d})$ .

Now, assume that $\delta < \delta_1$ and that $\text{REG}_\alpha(\ell+1,\delta)$ occurs. Fix $S \subseteq \mathcal{P}_{\alpha \lambda} \cap B_{\ell-r}(o)$ with $|S| \le k$ , and also fix $x \in S$ . For each $Q \in \mathcal{C}_\delta$ define

\[ \mathscr{E}_x(Q) \,:\!=\, \bigg| \frac{|(\mathcal{P}_{\alpha\lambda}\cap Q \cap B_r(x) )\backslash S|}{\alpha \lambda} - \int_Q \textbf{1}\{\|y-x\| \le r\}\,\text{d}y\bigg|. \]

If $Q \cap \partial B_r(x) \neq \varnothing$ we bound

\begin{equation*} \mathscr{E}_x(Q) \le \frac{|\mathcal{P}_{\alpha\lambda} \cap Q|}{\alpha \lambda} + \delta^d \le (1+\delta)\delta^d + \delta^d =(2+\delta)\delta^d \end{equation*}

by the triangle inequality and the definition of $\text{REG}_\alpha(\ell,\delta)$ . If $Q \subseteq B_r(x)$ with $Q \cap \partial B_r(x) = \varnothing$ we have

\[ \frac{|\mathcal{P}_{\alpha\lambda} \cap Q \cap B_r(x)|}{\alpha \lambda} = \frac{|\mathcal{P}_{\alpha\lambda} \cap Q|}{\alpha \lambda} \in \big((1-\delta)\delta^d,(1+\delta)\delta^d\big), \]

so we bound $\mathscr{E}_x(Q) \le ({k}/{\alpha\lambda})+\delta\cdot \delta^d \le 2\delta^{d+1}$ (the factor ${k}/{\alpha \lambda}$ is there to account for the possibility that Q contains some points of S; the second inequality holds if $\alpha$ is large enough that $k/(\alpha \lambda) < \delta^{d+1}$ ). Now, also using (4.7), the left-hand side of (4.6) is at most

\begin{align*} \sum_{x \in S} \sum_{Q \in \mathcal{C}_\delta} \mathscr{E}_x(Q) & \le \sum_{x \in S} \bigg((2+\delta)\delta^d \sum_{Q \in \mathcal{C}_\delta} \textbf{1}\{Q \cap \partial B_r(x) \neq \varnothing\} + 2\delta^{d+1} \frac{\upsilon_d r^d}{\delta^d}\bigg) \\ & \le k \cdot \bigg(\frac{(2+\delta)\varepsilon}{3k} + 2\delta^{d+1}\frac{\upsilon_d r^d}{\delta^d}\bigg). \end{align*}

If $\delta$ is small enough, the right-hand side is smaller than $\varepsilon$ , completing the proof.

Lemma 4.3. Let $f\,:\,\mathbb{R}^d \to \mathbb{R}$ be continuous with compact support, $k\in \mathbb{N}$ , and $\varepsilon > 0$ . There exists $\alpha_0 > 0$ such that, for any $\alpha \ge \alpha_0$ , with probability larger than $1-\varepsilon$ , $\mathcal{P}_{\alpha\lambda}$ satisfies the following. For any set $S \subseteq B_{kr}(o) \cap \mathcal{P}_{\alpha\lambda}$ with $|S|\le k$ ,

\[ \bigg|\int_{\mathbb{R}^d} f(x)\,\mathcal{K}_\alpha(S,\text{d}x) - \int_{\mathbb{R}^d}f(x)\,\mathcal{K}(S,\text{d}x)\bigg| < \varepsilon. \]

Proof. Fix f, k, and $\varepsilon$ as in the statement of the lemma. Since f is continuous with compact support, it is easy to see that we can choose a constant $\delta_0$ small enough that, for any $\delta \in (0,\delta_0)$ , $\sup_{\mu^{\prime},\mu^{\prime\prime}}\big|\int_{\mathbb{R}^d}f\,\text{d}\mu^{\prime} - \int_{\mathbb{R}^d}f\,\text{d}\mu^{\prime\prime}\big| < \varepsilon$ , where the supremum is taken over all pairs of probability measures $\mu^{\prime},\mu^{\prime\prime}$ on Borel sets of $\mathbb{R}^d$ with

(4.8) \begin{equation} \sum_{Q \in \mathcal{C}_\delta}|\mu^{\prime}(Q)-\mu^{\prime\prime}(Q)| < \delta. \end{equation}

Next, let $\varepsilon^{\prime} \,:\!=\, {\delta_0 \upsilon_d r^d}/{2}$ , and choose the constant $\delta_1 = \delta_1(\varepsilon^{\prime},k)$ as in Lemma 4.2.

Letting $\ell$ be large enough that the support of f is contained in $B_\ell(o)$ , assume that the event $\text{REG}_{\alpha}(\ell+rk+1,\delta_1)$ occurs, and let $S \subseteq B_{rk}(o) \cap \mathcal{P}_{\alpha\lambda}$ be a set with at most k points. Using the triangle inequality and Lemma 4.2, we bound

(4.9) \begin{align} & \sum_{Q \in \mathcal{C}_{\delta_1}} \bigg|\frac{\mathcal{N}_{\alpha}(S)}{\alpha\lambda} \cdot \mathcal{K}_{\alpha}(S,Q) - |S|\upsilon_d r^d \cdot \mathcal{K}(S,Q)\bigg| \\ & \quad \quad \quad \quad \quad \quad \quad \quad \quad \le \sum_{x \in S}\sum_{Q \in \mathcal{C}_{\delta_1}} \bigg|\frac{|(\mathcal{P}_{\alpha\lambda}\cap Q \cap B_r(x) )\backslash S|}{\alpha\lambda} - \int_Q \textbf{1}\{\|y-x\| \le r\}\,\text{d}y\bigg| \le \varepsilon^{\prime}. \end{align}

Using the fact that $\sum_Q \mathcal{K}_\alpha(S,Q) = \sum_Q \mathcal{K}(S,Q)=1$ , this readily gives

(4.10) \begin{align} \bigg|\frac{\mathcal{N}_{\alpha}(S)}{\alpha\lambda} - |S|\upsilon_dr^d\bigg| & = \bigg|\frac{\mathcal{N}_\alpha(S)}{\alpha \lambda} \sum_{Q \in \mathcal{C}_\delta} \mathcal{K}_\alpha(S,Q) - |S|\upsilon_dr^d \sum_{Q \in \mathcal{C}_\delta} \mathcal{K}(S,Q)\bigg| \nonumber \\ & \le \sum_{Q \in \mathcal{C}_{\delta_1}}\bigg|\frac{\mathcal{N}_{\alpha}(S)}{\alpha\lambda} \cdot \mathcal{K}_{\alpha}(S,Q) - |S|\upsilon_d r^d \cdot \mathcal{K}(S,Q)\bigg| \le \varepsilon^{\prime}. \end{align}

Next, the triangle inequality gives, for any $Q \in \mathcal{C}_\delta$ ,

\begin{align*} |\mathcal{K}_{\alpha}(S,Q) - \mathcal{K}(S,Q)|\le\frac{1}{|S|\upsilon_dr^d} & \bigg(\bigg| |S|\upsilon_dr^d - \frac{\mathcal{N}_{\alpha}(S)}{\alpha\lambda}\bigg| \cdot \mathcal{K}_{\alpha}(S,Q) \\ & \quad + \bigg|\frac{\mathcal{N}_{\alpha}(S)}{\alpha\lambda} \cdot \mathcal{K}_{\alpha}(S,Q) - |S|\upsilon_dr^d \cdot \mathcal{K}(S,Q)\bigg|\bigg). \end{align*}

Combining this with (4.9) and (4.10), we obtain

\begin{equation*} \sum_{Q \in \mathcal{C}_{\delta_1}} |\mathcal{K}_{\alpha}(S,Q) - \mathcal{K}(S,Q)| \le \frac{\varepsilon^{\prime}}{|S|\upsilon_dr^d} \Bigg(\sum_{Q \in \mathcal{C}_{\delta_1}}\mathcal{K}_{\alpha}(S,Q) + 1\Bigg) \le \frac{2\varepsilon^{\prime}}{\upsilon_dr^d} = \delta_0. \end{equation*}

This shows that $\mathcal{K}_\alpha(S,\cdot)$ and $\mathcal{K}(S,\cdot)$ are close enough in the sense that (4.8) is satisfied. The proof is now completed using (4.5).

The following lemma is proved in a similar manner to Lemma 4.3, only simpler, so we omit the details.

Lemma 4.4. Let $g\,:\,(0,+\infty) \to \mathbb{R}$ be continuous with compact support, $k\in \mathbb{N}$ , and $\varepsilon > 0$ . There exists $\alpha_0 > 0$ such that, for any $\alpha \ge \alpha_0$ , with probability larger than $1-\varepsilon$ , $\mathcal{P}_{\alpha\lambda}$ satisfies the following. For any set $S \subseteq B_{kr}(o) \cap \mathcal{P}_{\alpha\lambda}$ with $|S|\le k$ ,

\[ \bigg|\int_{(0,+\infty)} g(t)\,\mathcal{L}_\alpha(S,\text{d}t) - \int_{(0,+\infty)}g(t)\,\mathcal{L}(S,\text{d}t)\bigg| < \varepsilon. \]

Acknowledgements

We thank the team from Orange S.A. as well as W. König and A. Tóbiás for inspiring discussions. The article was written when L. R. de Lima was visiting the Department of Mathematics of the Bernoulli Institute at the University of Groningen. He is grateful for their hospitality.

Funding information

This work was funded by the German Research Foundation under Germany’s Excellence Strategy MATH+: The Berlin Mathematics Research Center, EXC-2046/1 project ID: 390685689, Orange Labs S.A., and the German Leibniz Association via the Leibniz Competition 2020. Research also supported by grants #2017/10555-0, #2019/19056-2, and #2020/12868-9, São Paulo Research Foundation (FAPESP).

The authors also thank the anonymous reviewers for their careful inspection of an earlier version of the manuscript, which helped to substantially improve the paper.

Competing interests

There were no competing interests to declare which arose during the preparation or publication process of this article.

References

Auffinger, A., Damron, M. and Hanson, J. (2017). 50 Years of First-Passage Percolation (University Lecture Ser. 68). American Mathematical Society, Providence, RI.CrossRefGoogle Scholar
Deijfen, M. (2003). Asymptotic shape in a continuum growth model. Adv. Appl. Prob. 35, 303318.CrossRefGoogle Scholar
Ethier, S. N. and Kurtz, T. G. (2009). Markov Processes: Characterization and Convergence. Wiley, Chichester.Google Scholar
Hammersley, J. and Welsh, D. (1965). First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. In Bernoulli 1713 Bayes 1763 Laplace 1813, eds. J. Neyman and L. M. Cam. Springer, New York, pp. 61110.Google Scholar
Hirsch, C., Neuhäuser, D., Gloaguen, C. and Schmidt, V. (2015). First passage percolation on random geometric graphs and an application to shortest-path trees. Adv. Appl. Prob. 47, 328354.CrossRefGoogle Scholar
Jahnel, B. and König, W. (2020). Probabilistic Methods In Telecommunications. Birkhäuser, Basel.CrossRefGoogle Scholar
Kesten, H. (1986). Aspects of first passage percolation. In École d’été de probabilités de Saint Flour, 1984 (Lect. Notes Math. 1180), eds. R. Carmona, H. Kesten and J. B. Walsh. Springer, Berlin, pp. 125264.Google Scholar
Kingman, J. (1968). The ergodic theory of subadditive stochastic processes. J. R. Statist. Soc. B 30, 499510.Google Scholar
Meester, R. and Roy, R. (1996). Continuum Percolation (Cambridge Tracts Math. 119). Cambridge University Press.Google Scholar
Ménard, L. and Singh, A. (2016). Percolation by cumulative merging and phase transition for the contact process on random graphs. Ann. Sci. École Normale Supérieure (4) 49, 11891238.CrossRefGoogle Scholar
Penrose, M. (2003). Random Geometric Graphs (Oxford Studies Prob. 5). Oxford University Press.Google Scholar
Penrose, M. and Pisztora, A. (1996). Large deviations for discrete and continuous percolation. Adv. Appl. Prob. 28, 2952.CrossRefGoogle Scholar
Prokhorov, Y. V. (1956). Convergence of random processes and limit theorems in probability theory. Theory Prob. Appl. 1, 157214.CrossRefGoogle Scholar
Riblet, T. (2019). Le processus de contact sur le graphe booléen. PhD thesis, Université de Lorraine.Google Scholar
Richardson, D. (1973). Random growth in a tessellation. Proc. Camb. Phil. Soc. 74, 515528.CrossRefGoogle Scholar
Rosenthal, H. (1970). On the subspaces of $L^{p}$ $(p>2)$ spanned by sequences of independent random variables. Israel J. Math. 8, 273303.Google Scholar
Torquato, S. and Jiao, Y. (2012). Effect of dimensionality on the continuum percolation of overlapping hyperspheres and hypercubes. II. Simulation results and analyses. J. Chem. Phys. 137, 074106.CrossRefGoogle ScholarPubMed
Yao, C.-L., Chen, G. and Guo, T.-D. (2011). Large deviations for the graph distance in supercritical continuum percolation. J. Appl. Prob. 48, 154172.CrossRefGoogle Scholar
Figure 0

Figure 1. Simulation of the open clusters for a bond percolation model on a two-dimensional RGG with $p<1/(\upsilon_d {r}^d\lambda)$.

Figure 1

Figure 2. Simulation of the spread of an infection given by the Richardson model on a bidimensional RGG.

Figure 2

Figure 3. A random geometric graph on $\mathbb{R}^2$ with the Voronoi partition generated by the infinite connected component $\mathcal{H}$ (in blue).