1. Introduction
The contact process on a graph is a popular interacting particle system that describes the spread of an infection in a structured population. The model is described informally as follows. The structure of the population is encoded by a graph, where vertices represent individuals that are susceptible to the infection and the edges depict the connections between them. Each infected vertex infects each of its neighbours with an infection rate
$\lambda > 0$
. Moreover, independently, each vertex recovers at rate 1. The contact process is sometimes also referred to as the susceptible–infected–susceptible (SIS) epidemic model.
The process is monotonic in the infection rate
$\lambda$
and it is therefore natural to ask whether there exists a phase transition. For an infinite rooted graph, there are two critical values of interest
$0\leq \lambda_1 \leq \lambda_2$
, which determine different regimes: in the extinction phase, for
$\lambda \in (0,\lambda_1)$
, the infection becomes extinct in finite time almost surely. In the weak survival phase, when
$\lambda\in (\lambda_1, \lambda_2)$
, the infection survives forever with positive probability, but the root is infected only finitely many times almost surely. Finally, in the strong survival phase, for
$\lambda \in (\lambda_2, \infty)$
, the infection also survives forever with positive probability; however, in this regime the root is infected infinitely many times with positive probability. Conversely, for a finite graph, the infection dies out almost surely in finite time, so the phase transition instead describes for how long the process survives. A typical example would be the transition between a polynomial and an exponential long time (expressed in terms of the size of the graph).
The analysis of the contact process is a classic topic, going back to the early results of Harris [Reference Harris9], who showed that, assuming that the process starts with a single infection, there exists a critical value
$\lambda_{\textrm{c}}(\mathbb{Z}^d)\in (0,\infty)$
such that if
$\lambda <\lambda_{\textrm{c}}(\mathbb{Z}^d)$
the process dies out almost surely, whereas if
$\lambda >\lambda_{\textrm{c}}(\mathbb{Z}^d)$
the infection survives with positive probability. Later, Bezuidenhout and Grimmett [Reference Bezuidenhout and Grimmett3] showed that the infection dies out at the critical value
$\lambda=\lambda_{\textrm{c}}(\mathbb{Z}^d)$
. According to Valesin [Reference Valesin20, p. 26], it is possible to show that
$\lambda_{\textrm{c}}(\mathbb{Z}^d)=\lambda_2$
. In other words, if
$\lambda\le \lambda_{\textrm{c}}(\mathbb{Z}^d)$
the process dies out, while if
$\lambda>\lambda_{\textrm{c}}(\mathbb{Z}^d)$
the process survives strongly.
See also [Reference Liggett13] for a general introduction to the topic. The same is not true for graphs where neighbourhoods from a fixed vertex grow faster with distance. Pemantle [Reference Pemantle17] showed for the infinite d-ary tree
$\mathbb{T}_d$
with
$d \geq 3$
that the contact process satisfies
$0<\lambda_1(\mathbb{T}_d)<\lambda_2(\mathbb{T}_d)<\infty$
. This result was later extended to the case
$d=2$
by Liggett [Reference Liggett12], see also [Reference Stacey19] for a short proof, which works for all
$d\geq2$
. The contact process has also been studied on certain inhomogeneous classes of graph. Chatterjee and Durrett [Reference Chatterjee and Durrett5] considered the contact process on power law random graphs and showed that the infection exhibits long survival for any
$\lambda>0$
, contradicting mean-field calculations as previously obtained by Pastor-Satorras and Vespignani [Reference Pastor-Satorras and Vespignani15, Reference Pastor-Satorras and Vespignani16].
More recently, the question about the existence of a phase transition for the contact process on Bienaymé–Galton–Watson (BGW) trees was settled: Huang and Durrett [Reference Huang and Durrett11] showed that for the contact process on BGW trees the critical value for local survival is
$\lambda_2=0$
if the offspring distribution
$\mathscr{L}(\xi)$
is subexponential, i.e. if
$\mathbb{E}[\mathrm{e}^{c\xi}]=\infty$
for all
$c>0$
. Shortly afterwards, Bhamidi et al. [Reference Bhamidi, Nam, Nguyen and Sly4] proved that, on BGW trees,
$\lambda_1>0$
if the offspring distribution
$\mathscr{L}(\xi)$
has an exponential tail, i.e. if
$\mathbb{E}[\mathrm{e}^{c\xi}]<\infty$
for some
$c>0$
. These two results give a complete characterisation for the existence of an extinction phase on BGW trees, while the question of whether
$\lambda_1 < \lambda_2$
in general remains open.
A natural generalisation of the contact process is to introduce inhomogeneities into the graph by associating a random fitness to each vertex that influences how likely the vertex is to receive and to pass on the infection. Peterson [Reference Peterson18] introduced the contact process with inhomogeneous weights on the complete graph so that the infection rate between vertices i and j is
$\lambda \mathcal{F}_i \mathcal{F}_j / n$
, where
$\lambda >0$
is a parameter, n is the graph size, and
$\mathcal{F}_i$
and
$\mathcal{F}_j$
are the (random) fitness values of vertices i and j. More precisely, under a second moment assumption on the weights, he proved that there is a phase transition at
$\lambda_{\textrm{c}}>0$
such that for
$\lambda<\lambda_{\textrm{c}}$
the contact process dies out in logarithmic time, and for
$\lambda>\lambda_{\textrm{c}}$
the contact process lives for an exponential amount of time. The way that Peterson chose the infection rates was inspired by inhomogeneous random graphs as introduced by Chung and Lu [Reference Chung and Lu6]. Xue [Reference Xue22, Reference Xue24] studied the contact process with random vertex weights with bounded support on oriented lattices. In particular, Xue investigated [Reference Xue22] the asymptotic behaviour of the critical value when the lattice dimension grows. Later, Pan et al. [Reference Pan, Chen and Xue14] extended his result to the case of regular trees. The reader is also referred to [Reference Xue21, Reference Xue23] for further results about the contact process with random weights and bounded support on regular graphs. In all these cases the fitness is bounded from above; we would also like to consider the case when this does not hold.
In this article, we are interested in understanding the interplay between the inhomogeneous contact process as considered by Peterson [Reference Peterson18] with an inhomogeneous graph such as the BGW tree. We focus on BGW trees, since these can be often used to describe the local geometry of random graphs and standard techniques should apply to translate our results to random graphs. A natural interest then is to study the phase diagram of this model and to understand how the extra randomness changes the characterisation of whether a phase transition occurs or not. A particular challenge is to differentiate the effect of having unusually large neighbourhoods versus having an unusually large fitness.
Our first result shows the existence of a phase transition when the distribution of the offspring and the fitness satisfy a certain mixed moment condition. In other words, for
$\mathcal{F}$
denoting the fitness associated to a vertex, we prove that if
$\mathbb{E}[\mathcal{F}(1+c\mathcal{F}\,)^{\xi}]<\infty$
for some
$c>0$
then the survival threshold is strictly positive. The second result tells us that if for some
$\vartheta>0$
we have
$ \mathbb{E}\big[(1+\mathcal{F}\,)^{c\xi}\mathbf{1}_{\{{ \xi \ge 7}, \, \mathcal{F}\ge \vartheta\}}\big]= \infty$
for all
$c>0$
then the process always survives strongly.
In our setting, the fitness has a significant effect on the behaviour of the model as a whole. For instance, if we consider the standard contact process on a BGW tree, where the offspring distribution has exponential tails, then, as mentioned earlier, the process exhibits a phase transition, so in particular the process dies out for small
$\lambda$
. However, if the distribution of the fitness values is sufficiently heavy-tailed then, irrespectively of how light the tails of the offspring distribution are, the process no longer has a phase of extinction. In other words, the presence of fitness guarantees that the infection survives forever with positive probability regardless of the value of
$\lambda$
. Conversely, we can also consider the case when the fitness value is a decreasing function of the degrees, so that the influence of high degrees is weakened. A special case of this scenario is the penalised contact process, recently introduced and analysed [Reference Bartha, Komjáthy and Valesin1]. In this case, the presence of the fitness can induce a phase transition, even if the standard contact process would not show one.
2. Definitions and main results
In this section, we formally introduce our model and state and discuss our main results. We consider a random weighted tree
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
. If
$V(\mathcal{T}\kern2.6pt)$
denotes the set of vertices then we associate to each vertex
$v \in \mathcal{T}$
a fitness value
$\mathcal{F}_v$
, so that
$\mathbb{F}(\mathcal{T}\kern2.6pt)= (\mathcal{F}_v)_{v \in V(\mathcal{T}\kern2.6pt)}$
. We assume that the (marginal) distribution of
$\mathcal{T}$
is that of a standard BGW tree with a root vertex
$\rho$
. Let
$\xi_v$
denote the number of children of v, which is the number of neighbours that are further away from the root than v itself. Let
$(\xi,\mathcal{F}\,)$
be a random variable taking values in
$\mathbb{N}_0 \times (0,\infty)$
, where we set
$\mathbb{N}_0\,:\!=\, \{0,1,\dots\}$
. We assume that
$(\xi_v, \mathcal{F}_v)_{v \in V(\mathcal{T}\kern2.6pt)}$
are independent and have the same distribution as
$(\xi,\mathcal{F}\,)$
, where we allow for correlations between the number of children and the fitness. Throughout, we assume that
$\mu \,:\!=\, \mathbb{E}[\xi] > 1$
, so that
$\mathcal{T}$
is infinite with positive probability and also that
$\mathcal{F} > 0$
almost surely. We refer to
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
constructed in this way as a weighted BGW tree.
Definition 1. Given a weighted BGW tree
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
, the inhomogeneous contact process on
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
is a continuous-time Markov chain with state space
$\{0,1\}^{V(\mathcal{T}\kern2.6pt)}$
, where a vertex is either infected (state 1) or healthy (state 0). We denote the process by
if
${\mathbf{1}_{A}}$
is the initial configuration, where the vertices in
$A\subset V(\mathcal{T}\kern2.6pt)$
are initially infected. Given
$\lambda >0$
, the process evolves according to the following rules.
-
(i) For each
$v \in V(\mathcal{T}\kern2.6pt)$
such that
$X_t(v)=1$
, the process
$X_t$
becomes
$X_t -\mathbf{1}_{v}$
at rate 1. -
(ii) For each
$v\in V(\mathcal{T}\kern2.6pt)$
such that
$X_t(v)=0$
, the process
$X_t$
becomes
$X_t + \mathbf{1}_{v}$
at rate where
\begin{align*} \lambda\sum_{v\sim v'} \mathcal{F}_{v'} \mathcal{F}_v X_t(v'),\end{align*}
$\mathcal{F}_v$
and
$\mathcal{F}_{v'}$
are the fitness values associated to v and v’ and
$v\sim v'$
means that vertices v and v’ are connected by an edge in
$\mathcal{T}$
.
By taking
$\mathcal{F}_v = 1$
in this definition, we recover the definition of the classic contact process on a BGW tree with offspring distribution
$\mathcal{L}(\xi)$
, where
$\mathcal{L}(\xi)$
denotes the law of
$\xi$
.
Notation. We use the notation 0 for the all-healthy state, i.e.
$\textbf{0}=\mathbf{1}_\emptyset$
. We also often identify any state
$\{ 0,1\}^{V(\mathcal{T}\kern2.6pt)}$
with the subset of
$V(\mathcal{T}\kern2.6pt)$
consisting of the vertices that have state 1 (i.e. the infected vertices). For example, when we write
$\rho \in X_t$
, this means that the root of the tree is infected at time t. We use the conditional probability measure
$\mathbb{P}_{\mathcal{T}, \mathbb{F}}(\!\cdot\!)\,:\!=\,\mathbb{P}\big(\cdot | \ \mathcal{T}, \mathbb{F}(\mathcal{T}\kern2.6pt)\big)$
with the associated expectation operator
$\mathbb{E}_{\mathcal{T}, \mathbb{F}}[\!\cdot\!]\,:\!=\,\mathbb{E}\big[\cdot | \ \mathcal{T}, \mathbb{F}(\mathcal{T}\kern2.6pt)\big]$
. For any set A, we write
$|A|$
to denote its cardinality.
Now, we define the critical values for the infection parameter
$\lambda$
. Given the tree
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
and the process starting with only the root infected, we define the threshold between extinction and weak survival as
and the weak–strong survival threshold as
By using the same arguments as in [Reference Pemantle17, Proposition 3.1], we see that
$\lambda_1(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
and
$\lambda_2(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
are constant for almost every
$(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
conditioned on
$|\mathcal{T}|=\infty$
. We let
$\lambda_1$
and
$\lambda_2$
denote these two constants.
Throughout, we suppose that
$\mu =\mathbb{E}[\xi]<\infty$
. We show in Theorem 3 that this condition guarantees that the set of infected vertices at every time is finite almost surely.
The main question we want to answer is whether the introduction of the fitness changes, whether the model exhibits a phase transition or not. In Section 3 we show that the process is monotonic in
$\lambda$
as well as in the fitness values
$\mathcal{F}_v$
. In particular, this allows us to compare the inhomogeneous process with the classical contact process on a BGW tree. More precisely, if there exists
$\vartheta > 0$
such that
$\mathbb{P}(\mathcal{F} \geq \vartheta) = 1$
then, if
$\xi$
is such that the standard contact process on a BGW tree with offspring distribution
$\mathcal{L}(\xi)$
has no phase transition, the same is true for the inhomogeneous process. Conversely, if there exists
$\kappa > 0$
such that
$\mathbb{P}(\mathcal{F} \leq \kappa) = 1$
then, if
$\xi$
is such that the standard contact process on a BGW tree with offspring distribution
$\mathcal{L}(\xi)$
dies out for small
$\lambda$
, the same is true for the inhomogeneous model.
The following theorem gives a sufficient criterion that guarantees the existence of a subcritical phase.
Theorem 1. Consider the inhomogeneous contact process on the tree
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
. Suppose that only the root of the tree is initially infected. Assume that
Then there exists a (deterministic)
$\lambda_0> 0$
such that, for all
$\lambda < \lambda_0$
, the process dies out almost surely.
Our second main theorem gives a sufficient criterion for the process to always survive strongly, so that there is no phase transition.
Theorem 2. Consider the inhomogeneous contact process on the tree
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
. Suppose that only the root of the tree is initially infected. Assume that
$\mathbb{P}(\xi\ge {7})>0$
and, for some
$\vartheta>0$
,
Then
$\lambda_1=\lambda_2=0$
, i.e. the process survives strongly for any
$\lambda>0$
.
Remark 1. (Existence of phase transition.) Condition (
A
) on its own does not imply a phase transition. It is still feasible that if very small fitness values are allowed then the process dies out for all
$\lambda > 0$
. However, if
$\mathcal{F}$
is bounded away from 0, i.e. there exists
$\vartheta > 0$
such that
$\mathbb{P}(\mathcal{F} \geq \vartheta) = 1$
, then, by comparison with the standard contact process, the inhomogeneous model survives (strongly) for all
$\lambda$
sufficiently large, so that we can deduce the existence of a phase transition in this case.
Remark 2. (Comparison with classical case.) In the special case when
$\mathcal{F}$
is constant, we recover the results already known in the literature. More precisely, if without loss of generality (w.l.o.g.)
$\mathcal{F}\equiv1$
, then Condition (
B
) reduces to the condition
$\mathbb{E}[\mathrm{e}^{\tilde{c}\xi}]=\infty$
for all
$\tilde{c}>0$
, which is known [Reference Huang and Durrett11, Theorem 1.4] to be a sufficient condition for the lack of a phase transition. Similarly, Condition (
A
) corresponds to
$\mathbb{E}[\mathrm{e}^{\tilde{c}\xi}]<\infty$
with
$\tilde{c} = \log\! (1+c)$
, which is known [Reference Bhamidi, Nam, Nguyen and Sly4, Theorem 1] to imply survival for small
$\lambda$
.
Remark 3. (Effect of the inhomogeneous fitness.) Note that the inhomogeneous fitness can either have the effect of preventing a phase transition if particularly large values are allowed or if small values are allowed it can introduce a phase transition when the classical model does not exhibit one. The following two examples are covered by our results.
-
(i) Assume that fitness and offspring distribution are independent and assume that
$\xi$
has exponential moments (but
$\mathbb{P}(\xi \geq {7}) > 0$
) and
$\mathcal{F}$
has unbounded support and satisfies Then the standard contact process has a phase transition, while Theorem 2 guarantees that the inhomogeneous contact process is always supercritical. This also includes the case of bounded degree graphs, such as a k-regular tree with
\begin{align*} \mathbb{E}\big[(1+\mathcal{F}\,)^{c}\mathbf{1}_{\{\mathcal{F}\ge \vartheta\}}\big] = \infty, \,\, { \text{for some } \vartheta>0 \text{ and }} \text{for all } c>0.\end{align*}
$k \geq {7}$
. Obviously, Condition (
B
) covers many other examples (including cases when there are dependencies between fitness values and offspring numbers).
-
(ii) Consider the inhomogeneous contact process with fitness values chosen as
$\mathcal{F}=\min\{1, \xi^{-\alpha}\}$
for
$\alpha\in (0,\infty)$
. This is a particular case of the degree-penalised contact process with product kernel
$\min\{1 , (\xi_u \xi_v)^{-\alpha}\}$
introduced by Bartha et al. [Reference Bartha, Komjáthy and Valesin1]. Note that in this case, using that
$(1+1/x)^x \leq \mathrm{e}$
for
$x > 0$
, we have (2.1)So if the right-hand side is finite then, according to Theorem 1, the inhomogeneous contact process exhibits a subcritical phase. A first example is when
\begin{equation} \mathbb{E}\left[\mathcal{F}(1+c\mathcal{F}\,)^{\xi}\right] \le \mathbb{E} \left[\xi^{-\alpha} (1+c\,\xi^{-\alpha})^{\xi}\right] \le \mathbb{E}\big[\mathrm{e}^{c\xi^{1-\alpha}}\big]. \end{equation}
$\alpha\geq 1$
, regardless of the distribution of
$\xi$
. Another example would be the case when
$\xi$
has a stretched exponential distribution, i.e.
$\mathbb{P}(\xi=k) \sim \exp\!(\!-k^{\beta})$
as
$k \rightarrow \infty$
for some
$\beta \in (0,1)$
and
$k\ge 1$
. Then if
$\beta \geq 1-\alpha$
the right-hand side of (2.1) is finite and there is a phase transition, even though the classical contact process has no phase transition.
Unfortunately, note that Theorem 2 does not apply in this setting as the expectation in Condition ( B ) is always restricted to
$\mathcal{F}\geq \vartheta$
, which, under the assumption on
$\mathcal{F}$
, means that
$\xi$
is restricted to values bounded from above. As also
$\mathcal{F} \leq 1$
, this implies that the expectation in (
B
) is always finite. Bartha et al. [Reference Bartha, Komjáthy and Valesin1] have shown results (using different techniques) that provide a much more complete picture in this case. In particular, they proved that the degree-penalised contact process with product kernel
$\min\{1 , (\xi_u \xi_v)^{-\alpha}\}$
always exhibits a subcritical phase if
$\alpha\ge 1/2$
. Conversely, if
$\alpha<1/2$
and the offspring distribution has tails heavier than the stretched exponential with
$\beta=1-2\alpha$
, then the contact process survives strongly for any
$\lambda>0$
(see [Reference Bartha, Komjáthy and Valesin1, Theorems 2.1 and 2.2]).
Remark 4. Note that there are cases that are not captured by either of the two conditions in Theorems 1 and 2. For example, suppose that
$\xi$
and
$\mathcal{F}$
are chosen independently with distributions
\begin{align*} \begin{aligned}\mathbb{P}(\xi =k) & = \eta_1\, \mathrm{e}^{-(1/4)k^2}, && k \in \mathbb{N},\\ \mathbb{P}(\mathcal{F}\geq f)& = \mathrm{e}^{-(1/4)(\!\log\! (1+f))^2}, && f \geq 0,\end{aligned}\end{align*}
where
$\eta_1$
is a normalising constant. It is not difficult to see that both distributions fulfil neither Assumption (
A
) nor Condition (
B
) of Theorems 1 and 2. In fact, for
$c>0$
, note that
\begin{align*} \begin{split}f(1+cf)^k \mathbb{P}(\xi= k) \mathbb{P}(\mathcal{F} \geq f) &= \eta_1 f(1+cf)^k \mathrm{e}^{-\frac{1}{4}k^2} \mathrm{e}^{-\frac{1}{4}(\!\log\! (1+f)^2}\\ & \geq \eta_1 c^k f^{k+1} \mathrm{e}^{-\frac{1}{4}k^2} \mathrm{e}^{-\frac{1}{4}(\!\log\! (1+f))^2}. \end{split} \end{align*}
Taking
$k=\lfloor \log\! (1+f)\rfloor$
, the right-hand side of the previous expression goes to
$\infty$
as
$f\to \infty$
, so
$\mathbb{E}[\mathcal{F} (1+c\mathcal{F}\,)^{\xi}]$
cannot be finite, as
Furthermore, Condition ( B ) is also not satisfied, as
\begin{equation*} \limsup_{\substack{f+k\to \infty\\ \, { k\ge 7}, \, f\ge \vartheta}} \frac{\log\! \big(\mathbb{P}(\xi=k) \mathbb{P}(\mathcal{F} \geq f)\big)}{k\log\! (1+f)}{=} \limsup_{\substack{f+k\to \infty\\ \, { k\ge 7}, \, f\ge \vartheta}} \frac{\log\! (\eta_1)}{k \log\! (1+f)}-\frac{1}{4}\frac{k}{\log\! (1+f)} -\frac{1}{4} \frac{\log\! (1+f)}{k} = -\frac{1}{2}, \end{equation*}
for any
$\vartheta>0$
, by Lemma 14.
In general, it is not clear what the correct moment condition is to give a complete characterisation for when a phase transition exists. We believe that this problem requires different techniques from those developed here and research is on-going.
2.1. Main ideas of proofs
In this section, we give a short overview of the proofs of the main theorems before giving the full proofs.
The proof of Theorem 1 is an adaptation of a simplified version of the proof from [Reference Bhamidi, Nam, Nguyen and Sly4]. See also the lecture notes of Daniel Valesin [Reference Valesin20], who presented a simplification of the standard contact process. First, we use a recursive analysis on BGW trees that allows us to control the expected survival times. To this end, we consider the contact process on the finite tree
$\mathcal{T}_L$
, which corresponds to the restriction of
$\mathcal{T}$
to the first L generations. The first goal is to show that, for small enough
$\lambda$
, the expected survival time of
$ {\textbf{CP}}(\mathcal{T}_L;\, \mathbf{1}_{\rho})$
is bounded from above uniformly in L. As in [Reference Bhamidi, Nam, Nguyen and Sly4], we use a coupling, where we add an extra vertex only adjoined to the root that is always infected. In this way, the process on the subtrees rooted in the children of the root can by independence be compared with the full process on a tree (with extra root) restricted to
$L-1$
vertices (see Lemma 2). The recursion gives a bound on the expected survival time on
$\mathcal{T}_L$
that is uniform in L. Thus, using monotone convergence, we get a bound on the expected survival time on the full tree, which immediately implies that the inhomogeneous contact process dies out almost surely.
The proof of Theorem 2 is based on techniques developed by Pemantle [Reference Pemantle17]. He used these techniques to show an upper bound for the threshold value
$\lambda_2$
for the contact process with constant fitness defined on BGW trees with constant offspring number, but also for those with a stretched exponential distribution. More recently, this strategy was extended by Durrett and Huang [Reference Huang and Durrett11, Theorem 1.4] to show that
$\lambda_2=0$
if
$\mathscr{L}\,(\xi)$
has subexponential tails. The same overall strategy holds in our case, but we need to take into account the effect of a possibly large fitness and thus large transmission rates.
First we estimate the survival time for the contact process with fitness on a finite star. For the case with constant fitness, Berger et al. [Reference Berger, Borgs, Chayes and Saberi2] showed that, for a star of size d, there are universal constants
$C>0$
and
$c>0$
such that if d is larger than
$C/\lambda^2$
, then the infection survives on the star for a time at least
$\mathrm{e}^{c\lambda^2d}$
with high probability.
Now, in the case with fitness, we prove that if the root of the star is initially infected it will keep a large number of infected leaves for a long time with probability very close to 1 if the fitness or the size of the star is large enough (see Lemma 7). The inhomogeneous contact process on a star, where the centre has fitness larger than f and the leaves have constant fitness equal to 1, can be lower bounded by a standard contact process where the infection rate is
$\lambda\, f$
. In particular, we need to take extra care to get the right estimates that also hold if only
$\lambda$
f (i.e. the effective transmission rate) is large but, for example, the size of the star is small. With the right estimates on the star at hand, we study the contact process in a star where a path is added to some leaf of the star (see Lemma 9) and look at the probability of passing the infection from the start to the end vertex of that path.
The overall strategy for the proof of Theorem 2, where we need to show that the root is infected at large times, is as follows. We first assume that the root is a star, i.e. it has either a sufficient large number of neighbours or large fitness. Then, the foregoing start lemmas allow us to push the infection sufficiently deep into the tree, where we can find another star, where the infection survives for a long time, so that the infection can be brought back to the root at the end.
2.2. Overview of structure
The remainder of this article is structured as follows. In Section 3, the graphical representation for the contact process is introduced and further useful properties are stated. In particular, we also show that, starting with a single infected vertex, the set of infected vertices stays finite at all times. Section 4 is devoted to the proof of Theorem 1. In Section 5, we prove preliminary results for the contact process with fitness on finite stars. Finally, in Section 6 the proof of Theorem 2 is completed.
3. Properties of the inhomogeneous contact process
In this section, an equivalent description of our model is provided by a convenient graphical representation based on the construction given in [Reference Liggett13, Chapter 1] for the case of constant fitness. We point out some properties that are direct consequences of the construction. Further, we show that, under the assumption
$\mathbb{E}[\xi]<\infty$
, the contact process does not explode in finite time almost surely, so that the set of infected vertices at any time is finite almost surely.
Recall that
$V(\mathcal{T}\kern2.6pt)$
denotes the set of vertices in
$\mathcal{T}$
. Denote by
$E(\mathcal{T}\kern2.6pt)$
the set of undirected edges. Conditionally on
$(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
, let
$\{N_{v}\}_{v\in V(\mathcal{T}\kern2.6pt)}$
be independent, identically distributed (i.i.d.) Poisson (point) processes with rate 1 and
$\{N_{(v,u)}\}_{(v,u)\in E(\mathcal{T}\kern2.6pt)}$
be i.i.d. Poisson processes with rate
$\lambda\mathcal{F}_{v}\mathcal{F}_{u}$
, where all the Poisson processes are mutually independent. Then, given any initial condition, the contact process can be defined as follows: an infected vertex v infects another vertex u at a time t if t is in
$N_{(v,u)}$
. Similarly, an infected vertex recovers at any time that is in
$N_{v}$
.
One advantage of the graphical construction is that it provides a joint coupling of the processes with different infection rules or different initial states. We state two useful facts about the contact process that we use later in our proofs and that are a consequence of using the graphical representation and the fact that we can e.g. easily couple Poisson processes with different rates.
-
• Monotonicity in the infection rates. Let
$\mathbb{F}_1(\mathcal{T}\kern2.6pt)=(\mathcal{F}_v^1)_{v\in V(\mathcal{T}\kern2.6pt)}$
and
$\mathbb{F}_2(\mathcal{T}\kern2.6pt)=(\mathcal{F}_v^2)_{v\in V(\mathcal{T}\kern2.6pt)}$
be sequences of fitness values such that
$\mathcal{F}_v^1\leq \mathcal{F}_v^2$
almost surely (a.s.) for all
$v\in V(\mathcal{T}\kern2.6pt)$
. Let
$(X_t^1)\sim {\textbf{CP}}((\mathcal{T}, \mathbb{F}_1(\mathcal{T\,\,}));\, \mathbf{1}_{A})$
and
$(X_t^2)\sim {\textbf{CP}}((\mathcal{T}, \mathbb{F}_2(\mathcal{T\,\,}));\, \mathbf{1}_{A})$
, starting from the same initially infected set
$A\subset V(\mathcal{T}\kern2.6pt)$
. Then we can couple both processes such that, for any
$t\geq 0$
, we have
$X_t^1\leq X_t^2$
, i.e. (see e.g. [Reference Peterson18, Section 1.2] for the case of the contact process with fitness in a completely deterministic graph).
\begin{align*} X_t^1(v)\leq X_t^2(v), \ \text{for all}\ v\in V(\mathcal{T}\kern2.6pt), \end{align*}
-
• Consider
$(X_t^1)\sim {\textbf{CP}}(\mathcal{T};\, {\mathbf{1}_{A}})$
, started from any initially infected set
$A\subset V(\mathcal{T}\kern2.6pt)$
. Let
$\textbf{I}$
be any subset of
$[0,\infty)$
. Define
$(X_t^2)$
to be a process that has the same initial state, infection, and recoveries as
$(X_t^1)$
, except that the recoveries at a fixed vertex
$v\in V(\mathcal{T}\kern2.6pt)$
are ignored at times
$t\in \textbf{I}$
. Then we can couple both processes such that for all
$t\geq 0$
we have
$X_t^1\leq X_t^2$
, i.e. (see, for instance, [Reference Bhamidi, Nam, Nguyen and Sly4, Lemma 2.2] for the case of the contact process with constant fitness).
\begin{align*} X_t^1(v)\leq X_t^2(v), \ \text{for all}\ v\in V(\mathcal{T}\kern2.6pt), \end{align*}
As a next result, we can show that if we start with a finite configuration, then almost surely the configuration remains finite for all times. Our argument adapts the proof of [Reference Durrett7, Theorem 2.1] to our setting with the additional difficulty that the underlying graph is random and we have unbounded rates.
Let r be an arbitrary non-negative integer. Let
$V_r$
denote the set of vertices in generation r in the tree
$\mathcal{T}$
, i.e.
where
$d(\cdot,\cdot)$
is the graph distance between two vertices in the tree. Let
$t_0$
be a positive number. Define the graph
$G_{t_0}$
, a spanning subgraph of the BGW tree
$\mathcal{T}$
, by saying that two vertices u, v in
$V(\mathcal{T}\kern2.6pt)$
with
$d(\rho, u) < d(\rho,v)$
that are neighbours in
$\mathcal{T}$
are also neighbours in
$G_{t_0}$
if
Let
$\mathscr{C}_{t_0}(v)$
denote the vertex set of the connected component of v in the graph
$G_{t_0}$
. We first show that if
$t_0$
is small enough then the component sizes in
$G_{t_0}$
are finite almost surely. Then we make the connection to the contact process as follows. If we are starting with only the root infected then, by the graphical construction and the fact that we are working on a tree, every vertex that has been infected by time
$t_0$
in the contact process is contained in
$\mathscr{C}_{t_0}(\rho)$
.
Lemma 1. Assume that
$\mu = \mathbb{E}[\xi]<\infty$
. If
$t_0$
is small enough then, for any finite
$\ell \in \mathbb{N}$
,
\begin{equation*} \mathbb{P}\Bigg (\Bigg |\bigcup_{v\in \bigcup_{r=0}^{\ell}V_r}\mathscr{C}_{t_0}(v)\Bigg |<\infty\Bigg )=1. \end{equation*}
Proof. We start by showing that
$|\mathscr{C}_{t_0}(\rho)| < \infty$
almost surely. For this result, by Borel–Cantelli, it suffices to show that
We begin by denoting the set of non-backtracking paths of length r in the tree
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
started at the root as follows:
Note that, with this notation,
$v_0=\rho$
and the number of paths of length r corresponds to the number of vertices in generation r, that is,
$|C_r|=|V_r|$
.
Let
$c=(v_0, \dots, v_r) \in C_r$
be a path of length r in
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
. For each
$i\in \{0,\dots, r\}$
, by definition of
$G_{t_0}$
, we have that the probability that the vertices
$v_{i-1}$
and
$v_i$
are connected in
$G_{t_0}$
is
By monotonicity, we may assume that
$r = 2k$
for some
$k \in \mathbb{N}_0$
. Thus, conditioning on
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
, the probability that there is a vertex in generation r that is also in
$\mathscr{C}_{t_0}(\rho)$
is
\begin{align*}\begin{split} \mathbb{P}_{\mathcal{T},\mathbb{F}}\big(\mathscr{C}_{t_0}(\rho)\cap V_r \not=\emptyset\big) &\leq \sum_{v \in C_r} \prod_{i=1}^{r}\big(1- \exp\big (\!-\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_{i}}t_0\big )\big) \\ & \leq \sum_{v \in C_r} \prod_{i=0}^{k-1}\big(1- \exp\big (\!-\lambda \mathcal{F}_{v_{2i}}\mathcal{F}_{v_{2i+1}}t_0\big )\big). \end{split}\end{align*}
Denote by
$\mathbb{T}_{\leq r}$
and
$\mathbb{F}_{\leq r}$
the
$\sigma$
-algebras generated by the BGW tree and the fitness values up to generation r, respectively. Conditioning on
$\mathbb{F}_{\le 2k-3}$
and
$\mathbb{T}_{\le 2(k-1)}$
and using the independence structure of the weighted BGW,
\begin{align*}\begin{aligned} \mathbb{E}\big[ \mathbb{P}_{\mathcal{T},\mathbb{F}} & \big(\mathscr{C}_{t_0}(\rho)\cap V_r \not=\emptyset\big) \, |\, \mathbb{F}_{\le 2k -3},\mathbb{T}_{\le 2k-2}\big] \\ & \leq \sum_{v \in C_{2k-2}} \prod_{i=1}^{k-2}\big(1- \exp\big (\!-\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_{i}}t_0\big )\big) \mathbb{E}\Bigg [ \sum_{w \in C_2} \big (1- \exp \big (\!-\lambda \mathcal{F}_{w_0}\mathcal{F}_{w_1}t_0 \big ) \big ) \Bigg ] , \end{aligned}\end{align*}
where
$w = (w_0,w_1,w_2)$
. Iterating this procedure gives
\begin{align*} \mathbb{P}\big(\mathscr{C}_{t_0}(\rho)\cap V_r \not=\emptyset\big) \leq \mathbb{E}\Bigg [ \sum_{w \in C_2} \big(1- \exp\big (\!-\lambda \mathcal{F}_{w_0}\mathcal{F}_{w_1}t_0\big )\big) \Bigg]^k . \end{align*}
As the summand in the last expectation is bounded by 1 and
$\mathbb{E}[ |C_2|] \leq \mathbb{E}[ \xi]^2 < \infty$
, we can deduce by dominated convergence that we can choose
$t_0$
small enough such that
\begin{align*} \mathbb{E}\Bigg[ \sum_{w \in C_2} \big(1- \exp\big(\!-\lambda \mathcal{F}_{w_0}\mathcal{F}_{w_1}t_0\big )\big) \Bigg] < 1. \end{align*}
Thus,
$\mathbb{P}\big(\mathscr{C}_{t_0}(\rho)\cap V_{2k} \not=\emptyset\big)$
is summable in k. Together with the monotonicity of the process, this implies (3.2). It follows by the Borel–Cantelli lemma that, almost surely for r sufficiently large,
$\mathscr{C}_{t_0}(\rho) \cap V_r = \emptyset$
with probability 1, so that
$|\mathscr{C}_{t_0}(\rho)|$
is finite almost surely.
The same argument shows that almost surely for each
$v \in V_\ell$
, we have that
$\mathscr{C}_{t_0}(v)$
, restricted to the vertices in the subtree of
$\mathcal{T}$
rooted at v, is finite. This immediately implies the statement of the lemma, as
$\bigcup_{r = 0}^\ell V_r$
is finite almost surely.
Theorem 3. Assume that
$\mu = \mathbb{E}[\xi]<\infty$
. Consider the inhomogeneous contact process
$(X_t)\sim {\textbf{CP}}(\mathcal{T}, \mathbf{1}_A)$
on
$(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
started with a finite set
$A \subset V(\mathcal{T}\kern2.6pt)$
initially infected. Then
Proof. Let
$t_0$
be as given in Lemma 1. Since the initial configuration of the contact process is finite, we can find a sufficiently large and finite k such that
$A \subset \bigcup_{r = 0}^k V_r$
, so that by the graphical construction we have that
$X_t\subset \bigcup_{v\in\bigcup_{r=0}^k V_r} \mathscr{C}_{t_0}(v)$
for all
$t\in [0,t_0] $
. Then, according to Lemma 1, we have that
Let us now define a spanning subgraph
$G_{2t_0}$
of
$\mathcal{T}$
as follows: two neighbouring vertices u, v in
$\mathcal{T}$
with
$d(\rho,u) < d(\rho,v)$
are connected if
As before, let
$\mathscr{C}_{t_0}(\rho)$
be the connected component of
$\rho$
in the graph
$G_{t_0}$
. For each
$v\in \mathscr{C}_{t_0}(\rho)$
, we denote by
$\mathscr{C}_{2t_0}(v)$
the connected component of v in the graph
$G_{2t_0}$
. We observe that by the graphical construction
Then we can argue that, by the independence of
$G_{t_0}$
and
$G_{2t_0}$
, and appealing again to Lemma 1, that the right-hand side is finite a.s., implying
Iterating the argument, we can conclude the proof.
4. Proof of Theorem 1
This section is devoted to proving Theorem 1. The general strategy follows the arguments used in [Reference Bhamidi, Nam, Nguyen and Sly4, Theorem 1], although the presence of fitness leads to significant changes. Moreover, we do not adapt their arguments directly, but follow a simplification of the arguments that was suggested to the authors by Daniel Valesin (see also his book [Reference Valesin20]).
First we set up some extra notation for this section. Let D denote the degree of the root
$\rho$
and let
$v_1, \dots,v_D$
be the children of
$\rho$
with fitness
$\mathcal{F}_{v_1},\dots, \mathcal{F}_{v_D}$
. We denote by
$\mathcal{T}_L$
the tree obtained by restricting the tree
$\mathcal{T}$
to the first L generations. Unless specified otherwise, we suppress the weights in our notation but implicitly inherit the weights of the vertices from the original weighted tree
$(\mathcal{T}, \mathbb{F}(\mathcal{T\,\,}))$
. For
$i = 1, \ldots, D$
, let
$\mathcal{T\,\,}_{L-1}^{v_i}$
be the subtree of
$\mathcal{T}_L$
consisting of all descendants of
$v_i$
(including
$v_i$
) rooted in
$v_i$
. Denote by
$\mathcal{T\,\,}_L^+$
the tree
$\mathcal{T}_L$
, but with an extra parent
$\rho^+$
attached to the vertex
$\rho$
. We assume that
$\rho^+$
has constant fitness, i.e.
$\mathcal{F}_{\rho^+}=1$
. Moreover, we denote by
$\mathcal{T\,\,}_{L-1}^{+, v_i}$
the subtree of
$\mathcal{T}_L$
consisting of
$\rho$
and all the descendants of
$v_i$
(including
$v_i$
itself).
Given any weighted tree T, a subset A of vertices of T, and a vertex v in T, we denote by
$\mathbf{CP}_v(T;\,\mathbf{1}_A)$
the inhomogeneous contact process that follows the same dynamics as
$\mathbf{CP}(T;\,\mathbf{1}_A)$
, but where vertex v is treated as permanently infected. Since the state of the vertex v never changes, we throughout specify the state of
${\textbf{CP}}_{v}(T;\, \mathbf{1}_A)$
by specifying the state restricted to
$T \setminus\{v\}$
, so that
${{\textbf{0}}}$
denotes the state where the only infected vertex is v. If the initial condition is irrelevant, we drop the notation
$\mathbf{1}_A$
.
Lemma 2. Suppose that
$\xi$
and
$\mathcal{F}_\rho$
satisfy Assumption (
A
), i.e. there exists
$c >0$
such that
$M = \mathbb{E} [ \mathcal{F} (1 + c \mathcal{F}\,)^{\xi}] < \infty$
. Let
$R_L$
be the first time when
${\textbf{CP}}(\mathcal{T}_L;\, \mathbf{1}_{\rho})$
reaches state 0. Then there exists a constant
$\lambda_0>0$
such that, for any
$\lambda\leq \lambda_0$
and L,
Proof. We denote by
$(\widetilde{X}_t) \sim \widetilde{\textbf{CP}}_{\rho^+}(\mathcal{T\,\,}_L^+;\, \mathbf{1}_{\rho})$
the following modification of the contact process
$\textbf{CP}_{\rho^+}(\mathcal{T\,\,}_L^+;\, \mathbf{1}_{\rho})$
. The process
$(\widetilde{X}_t)$
shares the same infection and recovery clocks as
$(X_t)$
, except in the root
$\rho$
. A recovery attempt at
$\rho$
at time t is only valid if
$\widetilde{X}_t = \mathbf{1}_{\rho}$
, namely, when there are no other infected vertices apart from
$\rho$
and
$\rho^+$
. Let
$S_L$
and
$\widetilde{S}_L$
be the first excursion time when the process
$\textbf{CP}_{\rho^+}(\mathcal{T\,\,}_L^+;\, \mathbf{1}_{\rho})$
and the modified process
$\widetilde{\textbf{CP}}_{\rho^+}(\mathcal{T\,\,}_L^+;\, \mathbf{1}_{\rho})$
reach state 0, respectively. An excursion to 0 of
$(\widetilde{X}_t) \sim \widetilde{\textbf{CP}}_{\rho^+}(\mathcal{T\,\,}_L^+;\, \mathbf{1}_{\rho})$
started from the initial configuration
$\widetilde{X}_0 = \mathbf{1}_{\rho}$
can be described as follows.
-
• Possibility 1. We terminate if
$\rho$
recovers before infecting any of its children. The probability that
$\rho$
recovers before infecting any of its children conditionally on
$(\mathcal{T}_L, \mathbb{F}(\mathcal{T}_L))$
is given by Furthermore, the expected waiting time to see the recovery of
\begin{equation*} p\,:\!=\, \frac{1}{1 + \lambda \mathcal{F}_{\rho}\sum_{j=1}^{D}\mathcal{F}_{v_j}}. \end{equation*}
$\rho$
is conditionally on the fitness and on the event that the recovery happens first.
\begin{align*} \frac{1}{1 + \lambda \mathcal{F}_\rho \sum_{j=1}^{D}\mathcal{F}_{v_j}}=p,\end{align*}
-
• Possibility 2. The root
$\rho$
infects any of its children, say
$v_i$
, before the recovery of
$\rho$
. The vertex
$v_i$
is selected with probability proportional to the fitness of the root’s children, i.e. with probability Let
\begin{equation*} \frac{ \mathcal{F}_{v_i}}{\sum_{j=1}^{D}\mathcal{F}_{v_j}}. \end{equation*}
$S_i$
be the first time that
$\mathbf{CP}_\rho(\mathcal{T}_L,\mathbf{1}_{v_i})$
reaches the all-healthy state on
$\bigcup_{i=1}^D \mathcal{T\,\,}_{L-1}^{v_i}$
. Then the expected waiting time until all subtrees of the root have recovered is
$\mathbb{E}_{\mathcal{T}_L, \mathbb{F}}[S_i]$
, conditionally on vertex
$v_i$
being infected first. When this excursion finishes, we come back to the initial state and follow either possibility 1 or possibility 2.
Note that we have reached state
$\mathbf{0}$
as soon as the process follows possibility 1. Hence, by splitting according to the number of times the process follows possibility 2 before finally taking possibility 1, we obtain the expected excursion time to 0 of
$(\widetilde{X}_t)$
, given the tree
$({\mathcal{T}_L, \mathbb{F}(\mathcal{T}_L)})$
, as
\begin{align*} \mathbb{E}_{\mathcal{T}_L, \mathbb{F}}\big [\,\widetilde{S}_L\big] &= \sum_{k=0}^{\infty} p (1-p )^k \bigg[(k+1) p + \frac{k }{ \sum_{i=1}^{D} \mathcal{F}_{v_i}} \sum_{j=1}^D \mathcal{F}_{v_j}\mathbb{E}_{\mathcal{T}_L, \mathbb{F}} [S_j ] \bigg]\\ &= \sum_{k=0}^{\infty} p (1-p )^k \bigg [(k+1) p + \frac{k D}{ \sum_{i=1}^{D} \mathcal{F}_{v_i}} \mathbb{E}_{\mathcal{T}_L, \mathbb{F}} [S ] \bigg ], \end{align*}
where in the last equality we use the notation
\begin{equation} S= \frac{1}{D} \sum_{i=1}^D \mathcal{F}_{v_i} S_i, \end{equation}
where we assume that the different
$S_i$
are coupled via the same graphical construction on the same underlying tree but have different initial conditions (but in fact only the marginal distributions matter, as we are only interested in the expectation of S). Calculating the series in the previous display explicitly, we obtain
Now we find a recursive upper bound for
$\mathbb{E}_{\mathcal{T}_L, \mathbb{F}}[\widetilde{S}_L] $
by establishing a relationship between
$ \mathbb{E}_{\mathcal{T}_L, \mathbb{F}}[S] $
and the stationary distribution of the contact process
$\textbf{CP}_{\rho}(\mathcal{T}_L)$
. Denote by
$S_{L-1}^{i}$
the first time when
$\textbf{CP}_{\rho}(\mathcal{T\,\,}_{L-1}^{+, v_i};\, \mathbf{1}_{v_i})$
becomes 0 on
$\mathcal{T\,\,}_{L-1}^{v_i}$
. For
$\textbf{CP}_\rho(\mathcal{T\,\,}^{+,v_i}_{L-1})$
, the rate of leaving the state 0 and the expected return time to 0 are given by
Similarly, for the process
$\textbf{CP}_{\rho}(\mathcal{T}_L)$
we also find these two quantities:
\begin{align*}\begin{split} q(\textbf{0}) \,:\!=\, \lambda \mathcal{F}_{\rho} \sum_{i=1}^{D} \mathcal{F}_{v_i}\quad \text{and}\quad m({\textbf{0}}) \,:\!=\, \frac{1}{q(\textbf{0})} + \sum_{i=1}^{D} \frac{\lambda \mathcal{F}_\rho \mathcal{F}_{v_i}}{q(\textbf{0})} \mathbb{E}_{\mathcal{T}_L, \mathbb{F}} [S_i ], \end{split} \end{align*}
where we recall that
$S_i$
is the first time when
$\textbf{CP}_{\rho}(\mathcal{T}_L;\, \mathbf{1}_{v_i})$
reaches the completely recovered state 0 on
$\bigcup_{i=1}^D \mathcal{T\,\,}_{L-1}^{v_i}$
. Let
$\widetilde{\nu}_{\mathcal{T}_L}$
and
$\nu_{\mathcal{T}_{v_i}}$
be the stationary distribution of
$\textbf{CP}_{\rho}(\mathcal{T}_L)$
and
$\textbf{CP}_{\rho}(\mathcal{T\,\,}_{L-1}^{+,v_i}),$
respectively. Therefore, we have
Note that, also in
$\textbf{CP}_{\rho}(\mathcal{T}_L)$
, the process restricted to each subtree
$\mathcal{T\,\,}_{L-1}^{v_i}$
evolves independently, so that
$\widetilde{\nu}_{\mathcal{T}_L}: = \otimes_{j=1}^D \nu_{\mathcal{T}_{v_j}}$
, which yields
\begin{equation} \widetilde{\nu}_{\mathcal{T}_L}(\textbf{0})\,=\,\frac{1}{1+\lambda D \mathcal{F}_{\rho} \mathbb{E}_{\mathcal{T}_L, \mathbb{F}} [S ]} \,=\, \prod_{i=1}^{D}\frac{1}{1+\lambda \mathcal{F}_{\rho} \mathcal{F}_{v_i}\mathbb{E}_{\mathcal{T\,\,}_{L-1}^{+,v_i}, \mathbb{F}} [S^{i}_{L-1} ]}. \end{equation}
Using this fact, we obtain from (4.2) that
\begin{equation*} \mathbb{E}_{\mathcal{T}_L, \mathbb{F}} [\widetilde{S}_L ] = 1 + \lambda D \mathcal{F}_{\rho} \mathbb{E}_{\mathcal{T}_L, \mathbb{F}} [S ] = \prod_{i=1}^{D} \Big (1+\lambda \mathcal{F}_{\rho} \mathcal{F}_{v_i}\mathbb{E}_{\mathcal{T\,\,}_{L-1}^{+,v_i}, \mathbb{F}} [S_{L-1}^{i} ] \Big ). \end{equation*}
Denote by
$\widetilde S_{L-1}^{i}$
the first time when
$\widetilde{\textbf{CP}}_{\rho}(\mathcal{T\,\,}^{+,v_i}_{L-1};\, \mathbf{1}_{v_i})$
reaches 0, where this process is defined as
$\textbf{CP}_{\rho}(\mathcal{T\,\,}^{+,v_i}_{L-1};\, \mathbf{1}_{v_i})$
but
$v_i$
is only allowed to recover if the subtree of all its children are all healthy. By using the monotonicity of the contact process, we have
$S_{L-1}^{i} \leq \widetilde S_{L-1}^{i}$
. Now, taking expectations conditionally only on D and
$\mathcal{F}_\rho$
and using the result that
$\widetilde S_{L-1}^{i}$
does not depend on
$\mathcal{F}_\rho$
by construction, we get
\begin{align*} \begin{split} \mathbb{E}\big[\widetilde{S}_L \mid D,\mathcal{F}_{\rho}\big ] &\leq \mathbb{E}\left[\prod_{i=1}^{D}\big(1+ \lambda \mathcal{F}_{\rho} \mathbb{E}\big[\mathcal{F}_{v_i}\widetilde S_{L-1}^{i}| \mathcal{T}_{v_i}, \mathbb{F}(\mathcal{T}_{v_i})\big]\big )\big|\big.D, \mathcal{F}_{\rho}\right] \\ &= \prod_{i=1}^{D}\big(1+ \lambda \mathcal{F}_{\rho} \mathbb{E}\big[\mathcal{F}_{v_i}\widetilde S_{L-1}^{i}\big]\big ). \end{split} \end{align*}
Moreover, we have
\begin{align*}\begin{split} \mathbb{E}\big[\widetilde{S}_L \mid D,\mathcal{F}_{\rho}\big ] = \prod_{i=1}^{D}\big (1+ \lambda \mathcal{F}_{\rho} \mathbb{E}\big[\mathcal{F}_{v_i }\widetilde S_{L-1}^i\big]\big ) = \big (1+\lambda \mathcal{F}_{\rho} \mathbb{E}\big [\mathcal{F}_{\rho}\widetilde S_{L-1} \big ]\big )^D. \end{split}\end{align*}
Thus, taking expectations over D and
$\mathcal{F}_\rho$
, we obtain
Now we apply an inductive argument over L to bound
$ \mathbb{E} [\mathcal{F}_\rho \widetilde S_L ]$
. We assume that
$\mathbb{E}[\mathcal{F}_{\rho}(1+c\mathcal{F}_\rho)^{\xi}]=M<\infty$
for some
$c>0$
, and define the following constants:
For the base case
$L=0$
, note that
$\widetilde S_0$
is an exponential random variable with parameter 1 that is independent of
$\mathcal{F}_\rho$
. Therefore,
so that the base case holds. Next we assume
$\mathbb{E}[\mathcal{F}_\rho \widetilde S_{L-1}]\leq M$
. Then we have, for any
$\lambda \le \lambda_0$
, that
Hence, since
$g(x)=\mathcal{F}_{\rho}(1+x\mathcal{F}_\rho)^{D}$
for
$x>0$
is an increasing function, we have, for any L and all
$\lambda\leq \lambda_0$
,
where the first inequality follows from (4.4). Moreover, taking into account the monotonicity of the contact process, we have
$S_L \leq \widetilde{S}_L$
, which yields, for any L and all
$\lambda\leq \lambda_0$
,
as required.
We are now ready to move to the proof of the main theorem of this section.
Proof of Theorem
1. We consider
$\lambda_0$
as defined in Lemma 2. Let
$\lambda\in (0,\lambda_0]$
. Let R denote the first time when
$ {\textbf{CP}}(\mathcal{T}; \mathbf{1}_{\rho})$
reaches state 0. Then, by the monotone convergence theorem and Lemmas 2, we obtain
Now since
$\mathcal{F}_{\rho}R$
is a non-negative random variable, we have that
$\mathcal{F}_{\rho}R<\infty$
almost surely. Therefore,
where in the second equality we have used that
$\mathcal{F}_\rho > 0$
almost surely. We conclude that, for all
$\lambda \leq \lambda_0$
, the process
$(X_t)\sim {\textbf{CP}}(\mathcal{T};\, \mathbf{1}_{\rho})$
dies out almost surely.
5. Finite stars
In this section, some results are shown for the inhomogeneous contact process on stars, which is used in the proof of Theorem 2 in the next section. Although any finite graph is eventually trapped in the state of zero infection, the stars are able to maintain the infection for a long time. Here we show that, if the root of the star is initially infected, the star will keep a large number of infected leaves for a long time with probability very close to 1.
Some of the results shown in this section are inspired by results obtained by Huang [Reference Huang10, Section 2]. However, it was necessary to adapt their arguments to take advantage of the fact that we can have a large fitness value associated to the root of the star. Throughout this section, we assume that the random variable
$\mathcal{F}$
takes values in
$[\vartheta,\infty)$
for some
$\vartheta>0$
.
We start this section by proving a lower bound for the probability of transferring the infection from one vertex to another in a graph consisting of a single path conditionally on the associated fitness values.
Lemma 3. Let r be an arbitrary non-negative integer and
$f\geq \vartheta$
a real number. Let
$\mathcal{C}_r$
be a graph consisting of a single path of length r on the vertices
$v_0,\dots, v_r$
with associated fitness values
$\mathbb{F}(\mathcal{C}_r)\,:\!=\,\{\mathcal{F}_{v_0},\dots, \mathcal{F}_{v_r}\}$
. Consider
$(X_t)\sim {{{\textbf{CP}}(\mathcal{C}_r; \mathbf{1}_{v_0})}}$
, the contact process on
$\mathcal{C}_r$
where
$v_0$
is initially infected. Then there exists a constant
$\gamma>0$
such that
\begin{equation*} \mathbb{P}_{\mathbb{F}}\Bigg(v_r \in \bigcup_{s\leq 2r} X_{s} \Bigg)= \mathbb{P}\Bigg(v_r \in \bigcup_{s\leq 2r} X_{s}\ |\ \mathbb{F}(\mathcal{C}_r),\, v_{0}\in X_0 \Bigg)\geq \big(1- \mathrm{e}^{-\gamma r}\big) \prod_{i=1}^{r} \frac{\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_i}}{1+\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_i}}. \end{equation*}
Moreover, in the event that
$\{ \mathcal{F}_{v_0}\geq f,\, \mathcal{F}_{v_r}\geq f\} $
, we have that
\begin{align*}\begin{split} \mathbb{P}\Bigg(v_r \in \bigcup_{s\leq 2r} X_{s}\ | & \ \mathbb{F}(\mathcal{C}_r),\, v_{0}\in X_0 \Bigg) \geq \big(1- \mathrm{e}^{-\gamma r}) C_{\lambda, f} \left(\frac{\lambda\vartheta^2}{\lambda\vartheta^2+1}\right)^r, \end{split}\end{align*}
where
Proof. It should be emphasised here that the notation
$ \mathbb{P}_{\mathbb{F}}(\!\cdot\!)$
corresponds to the conditional probability given the fitness and also that we start with
$v_0$
initially infected. Let r be an arbitrary non-negative integer. First, we need to establish some appropriate notation. We define the sequence of times
$(s_i)_{i\geq 0}$
by setting
$s_0=0$
and, for
$i\in \{1, \dots, r\}$
, defining
Denote
$T=\sum_{i=1}^{r}t_i$
where
$t_i\,:\!=\,s_i - s_{i-1}$
. Also denote the events
We begin by noting that, from the definition of the event B and the definition of T, we can obtain the following lower bound:
\begin{equation} \mathbb{P}_{\mathbb{F}}\Bigg(v_r \in \bigcup_{s\leq 2r} X_{s} \Bigg) \geq \mathbb{P}_{\mathbb{F}}\big(B\cap \{ T \leq 2r \}\big)= \mathbb{P}_{\mathbb{F}}\big( T\leq 2r\, | \, B\big)\mathbb{P}_{\mathbb{F}}(B). \end{equation}
Now we establish lower bounds for the two probabilities on the right-hand side of this equation. Conditioning on the fitness and also on the event
$\{v_{i-1}\in X_{s_{i-1}}\}$
, we know that the probability that
$v_{i-1}$
infects
$v_i$
before recovering is given by
where here we denote by
$\mathbb{P}_{\{\mathcal{F}_{v_{i-1}}, \mathcal{F}_{v_i}\}}(\!\cdot\!)$
the conditional probability
$\mathbb{P}(\!\cdot |\{\mathcal{F}_{v_{i-1}}, \mathcal{F}_{v_i}\} )$
. This implies that
Conversely, by an application of Markov’s inequality and by the definition of B and T, for any
$\theta >0$
,
\begin{align*} \begin{aligned} \mathbb{P}_\mathbb{F} (T\geq 2r\ | B ) = \mathbb{P}_\mathbb{F}\big( \mathrm{e}^{\theta T} \geq \mathrm{e}^{2\theta r}\ \big | B \big)\nonumber &\leq \mathrm{e}^{-2\theta r}\mathbb{E}_{ \mathbb{F}}\big[\mathrm{e}^{\theta T}\ \big | \ B\big] \\ &\leq \mathrm{e}^{-2\theta r}\prod_{i=1}^{r}\mathbb{E}_{\{\mathcal{F}_{v_{i-1}}, \mathcal{F}_{v_i}\}}\big[\mathrm{e}^{\theta t_i}\ \big|\big. \ B_i\cap\{v_{i-1}\in X_{s_{i-1}}\}\big]. \end{aligned} \end{align*}
By conditioning on the event
$B_i\cap\{v_{i-1}\in X_{s_{i-1}}\}$
, we obtain that
$t_i$
has an exponential distribution with parameter
$(1+\lambda \mathcal{F}_{v_{i-1}} \mathcal{F}_{v_i})$
. Therefore, we can couple
$t_i$
with a random variable
$\tau_i$
with an exponential distribution with parameter 1 such that
$t_i \leq \tau_i$
almost surely. Then, following the standard argument for a large deviation bound, we obtain that
where
$\phi(\theta^*) = \mathbb{E}[ e^{\theta^* \tau_i}]$
. Now, note that
Therefore, by choosing
$\theta^* > 0$
small enough, we can deduce that there exists
$\gamma > 0$
such that
Substituting (5.3) and (5.4) back into (5.2), we now see that
\begin{equation*} \mathbb{P}_{\mathbb{F}}\Bigg(v_r \in \bigcup_{s\leq 2r} X_{s} \Bigg)\geq \big(1-\mathrm{e}^{-\gamma r}\big) \prod_{i=1}^{r} \frac{\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_i}}{1+\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_i}}. \end{equation*}
For the second part, we fix
$f\geq \vartheta$
. Then, on the event
$\{\mathcal{F}_{v_0} \geq f, \, \mathcal{F}_{v_r}\geq f\}$
and using that
$\mathcal{F}_{v_i} \geq \vartheta$
, we obtain
\begin{equation*} \prod_{i=1}^{r} \frac{\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_i}}{1+\lambda \mathcal{F}_{v_{i-1}}\mathcal{F}_{v_i}} \geq \left(\frac{\lambda\vartheta^2}{1+\lambda\vartheta^2}\right)^{r-2}\left(\frac{\lambda f \vartheta}{1+\lambda f \vartheta}\right)^2, \end{equation*}
which yields the desired result.
Let
$G_k$
be a star of size k, that is,
$G_k$
consists of a root
$\rho$
and k other vertices each connected only to
$\rho$
, denoted by
$v_1,\dots, v_k$
. Let
$(X_t)\sim {{{\textbf{CP}}(G_k;\, \mathbf{1}_{\rho})}}$
denote the inhomogeneous contact process on
$G_k$
with the root initially infected. Define
$(X_t^0)$
to be the modification of
$(X_t)$
in such a way that the fitness values for the leaves satisfy
$\mathcal{F}_{v_1}=\dots = \mathcal{F}_{v_k}=\vartheta$
and the fitness of the root is
$\mathcal{F}_{\rho}=f \geq \vartheta$
. Note that the contact process
$(X_t^0)$
may be considered as a contact process without fitness and with rate parameter
$\tilde{\lambda}\,:\!=\,\lambda f\vartheta$
. Now, for the event
$\{\mathcal{F}_\rho \geq f\}$
, and taking into account that the random variable
$\mathcal{F}$
takes values in
$[\vartheta,\infty)$
, we have
Thus by monotonicity of the contact process in the rate parameter, as discussed in Section 3, we have
$X_t^0\subset X_t$
on the event
$\{\mathcal{F}_\rho \geq f\}$
. Moreover, on a star, the dynamics of
$(X_t^0)$
are the same as that of a standard contact process, but the infection rate is
$\lambda f\vartheta$
. In particular, we can use some of the results in [Reference Huang and Durrett11, Section 2] (see also [Reference Chatterjee and Durrett5, Lemma 2.2]) describing the persistence of the infection on a star. Some of the results can be taken over directly; however, others need to be adapted so that we can make full use of the fact that we have the extra flexibility of making f large enough.
When considering the process
$(X_t^0)$
, write the state of the star as (m, n), where m is the number of infected leaves and
$n=0$
or 1 if the centre is healthy or infected, respectively. Throughout, we write
$\Lambda_t^0 \subset X_t^0$
for the set of infected leaves. Also, we write
$\mathbb{P}_{(m,\,n)}$
if we are conditioning on
$X_0^0 = (m,n)$
.
As in [Reference Chatterjee and Durrett5, Reference Huang and Durrett11], we reduce the dynamics to a one-dimensional chain, by concentrating on the first coordinate (i.e. we count the number of infected leaves). As a first step, we ignore the times when the centre is not infected; as a second step, we stop the dynamics when we reach a certain level L of infected leaves. We can then define a suitable time-homogeneous Markov chain that lower bounds the number of infected leaves (running on a clock, but ignoring times when the centre is not infected).
To deal with the number of leaves that recover while the root is not infected, we note that, when the state is (m, 0) for some
$m>0$
, the next event will occur after an exponential time with mean
$1/(m\lambda f \vartheta + m)$
. The probability that the root is re-infected first is
$\lambda f \vartheta / (\lambda f \vartheta + 1)$
. Denote by
$\mathfrak{N}$
the number of infected leaves that will recover while the centre is healthy. Thus,
$\mathfrak{N}$
has a shifted geometric distribution with success probability
$\lambda f \vartheta / (\lambda f \vartheta +1)$
, i.e.
Fix
$\lambda>0, k\geq 1$
, and
$f\geq \vartheta$
and set a cut-off level
If we modify the chain so that the infection rate is 0 when the number of infected leaves is
$\geq L$
, then we can couple the number of infected leaves to a process
$(Y_t)_{t \geq 0}$
with the following dynamics:
\begin{equation} \begin{array}{lll} \text{jump} & \quad \text{at rate} \\ Y_t \to Y_t -1, & \quad L \\ Y_t \to \min\{Y_t +1, L\}, & \quad \lambda f \vartheta (k-L) \\ Y_t \to Y_t -\mathfrak{N}, & \quad 1, \end{array}\end{equation}
so that the process
$(Y_t)_{t\ge 0}$
stays below the number of infected leaves (ignoring times when the centre is not infected) as long as the original process has not yet hit the state (0, 0). For convenience, we do not stop the process after hitting a state below 0 and instead we are careful to apply the coupling only up to the hitting of (0, 0).
The following lemma shows that
$|\Lambda_t^0|$
hits level L before the process dies out with high probability. Also, we show that the first time
$(Y_t)$
hits L has small expectation. Our result is similar to those in [Reference Huang and Durrett11, Lemma 2.5] and [Reference Chatterjee and Durrett5, Lemma 2.3]; however, we need to adapt their arguments to give useful estimates also for large fitness.
To formalise these statements, denote, for the original chain, for any
$A \geq 0$
,
Moreover, for
$(Y_t)$
define for
$A \geq 0$
,
In the following lemma, we also consider the embedded discrete time process
$(Z_n)$
of
$(Y_t)$
obtained by looking at
$Y_t$
only at its jump times. This process has the property that, for either f or k large enough,
$((1+\lambda f \vartheta /2)^{{-Z_n}})$
is a supermartingale, while
${Z_n}\in (0,L).$
The proof follows from similar arguments to those used in [Reference Huang and Durrett11, Lemma 2.1].
Lemma 4. Let
$\lambda>0$
,
$f\ge \vartheta$
, and
$k\geq 7$
. For either f or k large enough,
$((1+\lambda f \vartheta /2)^{{-Z_n}})$
is a supermartingale, while
${Z_n}\in (0,L).$
Proof. Define
$\mathrm{e}^\theta= (1+\lambda f\vartheta/2)^{-1}$
and assume that
$Z_n\in (0,L)$
. After the same straightforward calculations as in [Reference Huang and Durrett11, Lemma 2.1] (but with infection rate
$\lambda f$
), we obtain with
$D= L+\lambda f\vartheta (k-L) +1 \ge 0$
, for
$y>0$
,
\begin{equation*} \begin{aligned} \mathbb{E}[\mathrm{e}^{\theta Z_{n+1}} - \mathrm{e}^{\theta Z_n} \mid Z_n=y] & = \frac{\mathrm{e}^{\theta y}}{D} \bigg((\mathrm{e}^{-\theta}-1)L + (\mathrm{e}^\theta -1)\lambda f\vartheta (k-L) + \frac{\mathrm{e}^{-\theta}-1}{1+\lambda f\vartheta - \mathrm{e}^{-\theta}}\bigg) \\ & = \frac{\mathrm{e}^{\theta y}}{D} \bigg(\frac{\lambda f \vartheta}{2}L - \frac{\lambda f \vartheta}{2+\lambda f \vartheta }\lambda f\vartheta (k-L) + 1\bigg) , \end{aligned} \end{equation*}
where we used the definition of
$\theta$
. It remains to show that the term in the bracket on the right-hand side is negative. We write, using the previously given definition of L,
\begin{align*} \begin{aligned} \frac{\lambda f \vartheta}{2}L & - \frac{\lambda f \vartheta}{2+\lambda f \vartheta }\lambda f\vartheta (k-L) + 1 \\ & = \lambda f \vartheta\Big( \frac{2+3\lambda f \vartheta}{2(2+\lambda f \vartheta)}L - \frac{\lambda f \vartheta}{2 + \lambda f \vartheta} k \Big) + 1 \\ & \leq \lambda f \vartheta\bigg( \frac{2+3\lambda f \vartheta}{2(2+\lambda f \vartheta)}\Big(\frac{\lambda f \vartheta k}{1+2\lambda f \vartheta}+1\Big) - \frac{\lambda f \vartheta}{2 + \lambda f \vartheta} k \bigg) + 1 \\ & = - \frac{(\lambda f \vartheta)^3}{2(2+ \lambda f \vartheta)(1+2\lambda f \vartheta)} k + \lambda f \vartheta \frac{2+3\lambda f \vartheta}{2(2+\lambda f \vartheta)} + 1 . \end{aligned} \end{align*}
Therefore, by calculating the asymptotics, we can deduce that the right-hand side is negative if either
$k \geq 7$
and f is large or if k is large.
Lemma 5. Let
$\lambda>0$
,
$k\geq 7$
, and
$f\geq \vartheta$
. Consider the stochastic process
$(Y_t)$
defined in (5.7) and the contact process
$(X_t^0)$
. Then, for either f or k large enough,
where
Remark 5. Note that [Reference Huang and Durrett11, Lemma 2.5] also states a result for the conditional expected value of
$T_L$
. In their proof, Huang and Durrett ignore times when the root is not infected, so that their result for the expected value is really only for
$T_L^Y$
. However, the estimate on the probability is only true for the original process and not for
$Y_t$
. We fix this omission by bounding the times when the root is not infected in the next lemma.
Proof. Let
$\lambda>0$
,
$k\geq 1$
, and
$f\geq \vartheta$
, and define
Recall the definition of the constant L given in (5.6) and note that
$K\leq L$
. We begin by observing that
\begin{equation*} \mathbb{P}_{(0,1)} (T_K < T_{0,0} ) \geq \prod_{j=0}^{K-1}\frac{(k-j)\lambda f \vartheta}{1+(k-j)\lambda f \vartheta + j}, \end{equation*}
where the term in the product corresponds to the probability that
$|\Lambda_t^0|$
jumps upwards K times before either the root or one of the leaves recovers. From the latter inequality and using [Reference Durrett8, Lemma 3.4.3], we have
\begin{align*}\begin{split} \mathbb{P}_{(0,1)}\big(T_K > T_{0,0}\big) &\leq \prod_{j=0}^{K-1}1 - \prod_{j=0}^{K-1}\frac{(k-j)\lambda f \vartheta}{1+(k-j)\lambda f \vartheta + j} \leq \sum_{j=0}^{K-1} \frac{1+j}{1+(k-j)\lambda f \vartheta+ j}\\ &\leq \sum_{j=0}^{K-1} \frac{1+j}{(k-j)\lambda f \vartheta} \leq \frac{K^2}{(k-K)\lambda f \vartheta}, \end{split}\end{align*}
where in the last inequality we have used that
$\{(1+j)/(k-j), j=0, \dots, K-1\}$
is increasing in j.
Note that, as the function
$x \mapsto {(x k^{1/3})} / {(1+2x)}$
is increasing in x, we can upper bound the function by its limit as
$x \rightarrow \infty$
, so that
as
$k \geq 1$
. Moreover, note that
$\frac{3}{2} k^{1/3} \leq \frac{3}{4} k$
for all
$k \geq 7$
. Using these two estimates, we have
for
$c = 4( \frac{3}{2})^2 =9$
.
Now, we use the jump process
$(Z_n)$
and Lemma 4. We assume that k or f is large, so that
$(1+\lambda f \vartheta/2)^{-Z_n}$
is a supermartingale while
$Z_n \in (0,L)$
. We denote by
$T_L^Z$
and
$R_0^Z$
the analogous hitting time of a level above L and the return time to a level below 0 for the process
$(Z_n)$
, respectively. Note that, since
$(Z_n)$
is obtained from
$(Y_t)$
by observing the process only at its jump times, we see that
$\{ T_L^{Y} > R_0^{Y} \} = \{ T_L^{Z} > R_0^{Z} \}$
. By an application of the optional stopping theorem with the bounded stopping time
$\tau \wedge n$
, where
$\tau= R_0^Z \wedge T_L^Z$
, we get
By letting
$n\to \infty$
, we deduce
which implies
Discarding the second term on the left-hand side, it follows that
To go back to the unmodified process, we use that
$\{ T_{0,0} < T_L \} \subset \{ R_0^Z < T_L^Z \}$
, so that we can apply (5.9). Combined with the strong Markov property, we obtain
\begin{align*} \mathbb{P}_{(0,1)} (T_L > T_{0,0} ) &\leq \mathbb{P}_{(0,1)} (T_K > T_{0,0} ) + \mathbb{P}_{(0,1)} (T_L > T_{0,0} \, |\, T_K < T_{0,0} ) \mathbb{P}_{(0,1)} (T_K < T_{0,0} )\\ &\leq \mathbb{P}_{(0,1)} (T_K > T_{0,0} ) + \mathbb{P}_{(K,1)} (T_L > T_{0,0} )\\ &\leq \mathbb{P}_{(0,1)} (T_K > T_{0,0} ) + \mathbb{P}_{K} (R_0^Z < T_L^Z ). \end{align*}
Then, combining with the previous estimates, we have the first claim of the lemma, that is,
The first claim of the lemma now follows, if we note that
where we used that if
$\lambda f \vartheta \geq 1$
, as
$x \mapsto {x} / ({1+2x})$
is increasing,
Moreover, if
$\lambda f \vartheta \leq 1$
, then using that
$\log(1 + x) \geq \frac 34 x$
for
$x \leq 1/2$
,
To deal with the second claim of the lemma, recall the random variable
$\mathfrak{N}$
defined in (5.5) with
$\mathbb{E}_{0} [\mathfrak{N}] = (\lambda f \vartheta)^{-1}$
. From the definition of the process, we can calculate the drift of
$Y_t$
before time
$T_L^Y$
as
so that
$(Y_t - \mu_{\lambda, f} t)$
is a martingale when stopped at
$T_L^Y$
.
An application of the optimal stopping theorem with the bounded stopping time
$T_L^Y \wedge t$
tells us that
Furthermore, if we can show that
$\mu_{\lambda,f} > 0$
, since
$\mathbb{E}_{0}[Y_{{ T_L^Y} \wedge t}] \leq L$
, we get the upper bound
Moreover, by taking
$t \to \infty$
, the same bound holds for
$\mathbb{E}_{0} [T_{L}^Y ]$
.
Thus, it remains to upper bound
$L / \mu_{\lambda,f}$
. Write
$x=\lambda f \vartheta$
and consider
\begin{equation*} \begin{split} \mu_{\lambda, f} &= xk -L(1+x) -\frac{1}{x}\ge xk-\Big(\frac{xk}{1+2x}+1\Big)(1+x)-\frac{1}{x}\\ &= \frac{x^2 k}{1+2x}-(1+x) - \frac{1}{x}. \end{split} \end{equation*}
Therefore,
holds if
This condition can be guaranteed by either taking
$k \geq 5$
and then f large enough (so that
$x = \lambda f \vartheta$
is large) so that the right-hand side is smaller than 5. Alternatively, the condition can be achieved by taking
$k \geq 18 \max\{ \frac{1}{x},1\} = 18\max\{ \frac{1}{\lambda f \vartheta},1\}$
.
In either case, we can deduce from (5.10) that
\begin{align*} \frac{L}{\mu_{\lambda, f}} \le \frac{\frac{xk}{1+2x}+1}{\frac{1}{2}\frac{x^2 k}{1+2x}}= 2 \bigg(\frac{1}{x}+\frac{2}{xk}+\frac{1}{x^2k}\bigg) \leq 2 \bigg(\frac{3}{x} + \frac{1}{x^2k}\bigg) { \le 8 \max\{ 1, x^{-2}\} } , \end{align*}
which gives the result claimed.
By combining the two results of the previous lemma with an estimate of the time that the root of the star is not infected, we can show that the process reaches L infected leaves before time
$f \kern0.5pt k^{2/3}$
with high probability for either f or k large.
Lemma 6. Let
$G_k$
be a star with leaves
$v_1,\dots, v_k$
and root
$\rho$
, where
$k\ge 7$
. Consider the contact process
$(X_t^0)\sim {{{\textbf{CP}}(G_k;\, \mathbf{1}_\rho)}}$
. Let
$\lambda >0$
be fixed. Then, for either f or k large enough,
where
$c_1(\lambda,f,\vartheta,k)$
is defined in (5.8) and
$\widehat{c}_1$
and
$\widehat{c}_2$
are positive constants not depending on any of the parameters.
Proof. Fix
$\lambda>0$
. Recall the process
$(Y_t)_{t\ge 0}$
given in (5.7) and its corresponding stopping times
$T_L^Y$
and
$R_0^Y$
. We begin by letting the stochastic process
$(\Gamma_t)_{t \geq 0}$
denote the number of infected leaves, where we ignore times when the root is not infected. Let us now introduce the stopping time
$T_L^\Gamma = \inf\{t > 0\,:\, \Gamma_t \geq L \}$
. Then, by definition, we have
$T_L \geq T_L^\Gamma$
a.s. Moreover, in the event that
$T_L < T_{0,0}$
, we have that
$T_L^\Gamma \leq T_L^{\,Y}$
.
Let us denote
$g(k)=f \kern0.5pt k^{2/3}$
and choose
$\delta>0$
as
Observe that
Our objective now is to find upper bounds for both probabilities on the right-hand side. First, we deal with the first of these probabilities. Note that
where we used the first part of Lemma 5. By the second part of the same lemma and Markov’s inequality, we also have that
Combining, we obtain
To estimate the second term in (5.11), let
$\ell_t$
denote the amount of time until t that the process
$(X_t^0)$
spends in the states when the root is not infected, i.e.
where
$|\cdot|$
denotes the Lebesgue measure. Note that, as
$T_L= T_L^{\Gamma} + \ell_{T_L}$
, it follows that
Now, we recall the random variable
$\mathfrak{N}$
defined in (5.5). Denote by
$m_t$
the number of times that the process
$(\Gamma_t)$
makes a downward jump with the same distribution as
$\mathfrak{N}$
until time t. Note that, if the current state is (i, 0) with
$i\geq 1$
, then the time until either the next jump down happens or the root becomes re-infected is given by an exponential random variable with distribution Exp
$(i(1+\lambda f \vartheta))$
. Such a random variable is stochastically dominated by another random variable that has distribution Exp
$(1+\lambda f \vartheta)$
. Hence, each time period when the root is healthy can be dominated by
\begin{align*}\sum_{i=1}^{\mathfrak{N}+1}E_i,\end{align*}
where, for each
$i=1, \dots, \mathfrak{N}+1$
, the random variables
$E_i$
have independent Exp
$(1+\lambda f \vartheta)$
distributions. Thus, in the event
$\{T_L^\Gamma <\delta g(k)\}$
, we deduce that
\begin{align*}\ell_{T_L} \leq \sum_{j=1}^{m_{T_L^\Gamma}}\sum_{i=1}^{\mathfrak{N}_j+1}E_i^{(j)} \leq\sum_{j=1}^{m_{\delta g(k)}}\sum_{i=1}^{\mathfrak{N}_j+1}E_i^{(j)},\end{align*}
where the random variables
$E_i^{(j)}$
have Exp
$(1+\lambda f \vartheta)$
distributions and
$\mathfrak{N}_j$
are independent random variables with the same distribution as
$\mathfrak{N}$
. Further, as
$\mathfrak{N}_{\mathfrak{j}}$
has a shifted geometric distribution, straightforward computations show that, for each j,
\begin{align*}\bar T_j\,:\!=\,\sum_{i=1}^{\mathfrak{N}_j+1}E_i^{(j)}\end{align*}
has an exponential distribution with parameter
$\lambda f \vartheta$
. Denote
$a\,:\!=\,(1-\delta)(2\delta)^{-1}$
. It follows by a large deviation upper bound (or Chernoff bound) that
\begin{align*} \mathbb{P}_{(0,1)} \big(T_L^\Gamma <\delta g(k), \, \ell_{T_L}>(1-\delta)g(k), \, m_{\delta g(k)} \leq 2\delta g(k)\big) \\ \leq \mathbb{P}_{(0,1)} \Bigg(\sum_{j=1}^{\lfloor 2\delta g(k)\rfloor} \bar T_j > (1-\delta)g(k)\Bigg) \leq \mathrm{e}^{-\lfloor 2\delta g(k) \rfloor I(a)}, \end{align*}
using that
$\mathbb{E}[ \bar T_j] = 1/{(\lambda f \vartheta)} \leq (1-\delta)/(2 \delta)$
by the definition of
$\delta$
and where I(a) is the rate function of an Exp
$(\lambda f \vartheta)$
-random variable, i.e.
Note that, if
$\lambda f \vartheta \geq 1$
, then
$\delta = 1/4$
and
$a = 3/2$
. Moreover, in this case using that
$x - 1 - \log x \geq x / 20$
for
$x \geq 3/2$
, we have that
Conversely, if
$\lambda f \vartheta \leq 1$
, then
$\delta = \lambda f \vartheta / 4$
and
so that, by the same bound as before,
$I(a) \geq a\lambda f\vartheta/20 \ge 3/40$
. Thus,
\begin{align*} \mathrm{e}^{-\lfloor 2\delta g(k)\rfloor I(a)} \;\le\; \begin{cases} \mathrm{e}^{\lambda f \vartheta/20}\mathrm{e}^{-\lambda f\vartheta g(k)/40}, & \text{if } \lambda f \vartheta \ge 1, \\[4pt] \mathrm{e}^{3/40} \mathrm{e}^{-3\lambda f\vartheta g(k)/80}, & \text{if } \lambda f \vartheta \le 1 . \end{cases} \end{align*}
If
$g(k) = f \kern0.5pt k^{2/3}\ge 4$
then
$\mathrm{e}^{\lambda f \vartheta/20}\mathrm{e}^{-\lambda f\vartheta g(k)/40}\le \mathrm{e}^{-\lambda f\vartheta f \kern0.5pt k^{2/3}/80}$
. Combining both cases, and using that
$\mathrm{e}^{3/30}\leq 2$
, we deduce that, for k or f sufficiently large,
In addition, note that the random variable
$m_{\delta g(k)}$
has a Poisson distribution with parameter
$\delta g(k)$
. Similarly, as before, using a large deviation bound (or Chernoff bound) we have
where
$a=2\delta g(k)$
and
Therefore, with
$\widehat{c}_1=2\log2 -1$
and
$\widehat{c}_2 = 1/80$
,
\begin{equation*} \begin{split} \mathbb{P}_{(0,1)}&\big(T_L^\Gamma < \delta g(k), \, \ell_{T_L}^\Gamma> (1-\delta) g(k)\big) \\ & \leq \mathbb{P}(m_{\delta g(k)}>2\delta g(k))+\mathbb{P}_{(0,1)}\big(T_L^\Gamma<\delta g(k), \, \ell_{T_L}>(1-\delta)g(k), \, m_{\delta g(k)} < 2\delta g(k)\big) \\ & \leq \mathrm{e}^{-\widehat{c}_1\delta g(k)} + {2\,} \mathrm{e}^{-\widehat{c}_2\lambda f\vartheta g(k)}. \end{split} \end{equation*}
Substituting the estimates back into (5.11), we obtain
\begin{equation*} \begin{split} \mathbb{P}_{(0,1)}\big(T_L>g(k)\big) &\leq \mathbb{P}_{(0,1)}\big(T_L^\Gamma >\delta g(k)\big) + \mathbb{P}_{(0,1)}\big(T_L>g(k), \, T_L^\Gamma <\delta g(k)\big) \\ & \leq {c_1(\lambda, f, \vartheta, k) + \frac{8 \max\{ 1, (\lambda f \vartheta)^{-2}\}}{\delta g(k)} } + \mathrm{e}^{-\widehat{c}_1\delta g(k)} + {2\,}\mathrm{e}^{-\widehat{c}_2\lambda f\vartheta g(k)}. \end{split} \end{equation*}
This concludes the proof.
The following lemma, proved by Huang and Durrett in [Reference Huang and Durrett11], is useful for our next result.
Lemma 7. ([Reference Huang and Durrett11 Lemma 2.4].) Let k be an arbitrary non-negative integer and
$f\geq \vartheta$
a real number. Let
$G_k$
be a star with leaves
$v_1,\dots,v_k$
and root
$\rho$
. Consider the contact process
$(X_t^0)\sim {{{\textbf{CP}}(G_k; \mathbf{1}_{\{\rho, v_1, \dots, v_L\}})}}$
, where
$\rho$
and
$L=\lceil\lambda f \vartheta k/(1+2\lambda f \vartheta)\rceil$
leaves are initially infected. Then, for any
$\epsilon \in (0,1/2)$
,
where
Remark 6.
(Choice of
$\epsilon$
.) We note that, when we want to apply Lemma 7, then we would like the probability on the right-hand side of (5.13) to go to zero and, at the same time, we want S to go to
$\infty$
. In the case when
$f \rightarrow \infty$
and k is fixed, we see that this requires that we choose
$\epsilon$
such that
This is only possible if
$1/L < (L-1)/(2L)$
or, in other words, if
$L > 3$
. Note that as
$f \rightarrow \infty$
, we have that
$L \rightarrow \lceil k/2 \rceil$
. Thus, the smallest value of k we can choose is
$k = 7$
, so that the smallest L is given by
$L= 4$
. In that case, we can check that (5.15) holds for
$\epsilon = \frac{5}{16}$
, which is our choice from now on.
Note also that, in the case when
$k \rightarrow \infty$
and f is fixed, both conditions hold automatically.
The next lemma tells us that if either f or k is large enough then, beginning with only vertex
$\rho$
infected at time 0, the number of infected leaves during the time interval
$[f \kern0.5pt k^{2/3},S]$
is at least
$\epsilon L$
with high probability.
Lemma 8. Let
${k\ge 7}$
be an integer and
$f\geq \vartheta$
a real number. Let
$G_k$
be a star of size k with root
$\rho$
. Consider
$(X_t)\sim {{{\textbf{CP}}(G_k;\mathbf{1}_{\rho})}}$
the inhomogeneous contact process on
$G_k$
and
$\Lambda_t \subset X_t$
its set of infected leaves. Fix
$\lambda >0$
, then for
$\epsilon = {{\frac{5}{16}}}$
, and for either f or k large enough, it holds that, in the event
$\{\mathcal{F}_{\rho} \geq f\}$
,
where
\begin{multline} R(f,k,\lambda) = c_1(\lambda, f, \vartheta, k) + \frac{32}{f k^{2/3}} \max\{ 1, (\lambda f \vartheta)^{-3}\} + \mathrm{e}^{-\widehat{c}_1 f \kern0.5pt k^{2/3}} + {2\,}\mathrm{e}^{-\widehat{c}_2\lambda f^2\vartheta k^{2/3}} \\ { + \min\Big\{ \widehat{C}_1 (2 + \lambda f \vartheta)^{-1/8} ,\, (3 + \lambda f \vartheta) (1 + \lambda \vartheta^2/2)^{ - {\frac{5}{16}} \frac{\lambda\vartheta^2}{1+2\lambda \vartheta^2} k } \Big\} } \end{multline}
and where
$\widehat{c}_1$
,
$\widehat{c}_2$
,
$\widehat{C}_1 $
are positive constants not depending on any of the parameters and
$c_1$
is defined in (5.8).
Proof. Fix
$\lambda >0$
. Here we use the notation
$\mathbb{P} ( \!\cdot\! )\,:\!=\, \mathbb{P} (\! \cdot \! | \ \mathbb{F})$
. We begin by noting that on the event
$\{\mathcal{F}_\rho\geq f\}$
and by monotonicity we have
Then it is enough to prove the estimate for the process
$(\Lambda_t^0)_{t\ge 0}$
. By the strong Markov property applied at
$T_L$
on the event that
$T_L < f \kern0.5pt k^{2/3}$
and using that at
$T_L$
the root is necessarily infected, we note that
\begin{align} \mathbb{P}_{(0,1)}&\bigg(\inf_{f \kern0.5pt k^{2/3} \leq t \leq S} |\Lambda_t^0| \leq \epsilon L \bigg) \nonumber\\ &= \mathbb{P}_{(0,1)}\bigg(\inf_{f \kern0.5pt k^{2/3} \leq t \leq S} |\Lambda_t^0| \leq \epsilon L, \, T_L \geq f \kern0.5pt k^{2/3} \bigg) \mathbb{P}_{(0,1)}\bigg(\inf_{f \kern0.5pt k^{2/3} \leq t \leq S} |\Lambda_t^0| \leq \epsilon L, \, T_L < f \kern0.5pt k^{2/3} \bigg) \nonumber\\ &\leq \mathbb{P}_{(0,1)}\big(T_L \geq f \kern0.5pt k^{2/3}\big) + \mathbb{P}_{(L,1)}\Big(\inf_{0 \leq t \leq S} |\Lambda_t^0| \leq \epsilon L\Big). \end{align}
Now, appealing to Lemma 7, we have for any
$\epsilon \in (0,1/2)$
and for either f or k large enough,
Now, if
$k\geq 7$
is fixed we can choose f sufficiently large so that
$L \geq \frac{9}{10}\lceil \frac{k}{2} \rceil$
and
$\lambda f \vartheta \geq 1$
. Therefore,
for some absolute constant
$\widehat{C}_1$
. For k large, we use that
$x \mapsto {x} / ({1+x})$
is increasing, so that
Substituting these two bounds back into (5.17) and using Lemma 6, we get the desired result.
One more lemma is needed for the next section, so it is recorded now. The result describes the behaviour of the contact process on a graph consisting of a star with a single path joined to one of its leaves. We give a lower bound for the probability that the vertex on the path that is furthest from the root will be infected, if we start with the root of the star infected. This is a similar result to that in [Reference Huang and Durrett11, Lemma 3.2].
Lemma 9. Let
$r\geq 1$
,
${k\ge 7}$
be integers, and
$f\geq \vartheta$
a real number. Let
$G_k$
be the star of size k with root
$\rho$
and leaves
$v_1, \dots, v_k$
, to which has been added a single path of length r of descendants of some child
$v_i$
of
$\rho$
. Denote by
$\mathcal{C}_{r}$
the path with vertices
$u_1,\dots, u_r$
with
$u_1=v_i$
and associated fitness values
$\{\mathcal{F}_{u_1},\dots, \mathcal{F}_{u_r}\}$
. Consider
$(X_t)\sim {{{\textbf{CP}}(G_k\cup \mathcal{C}_r; \mathbf{1}_{\rho})}}$
the inhomogeneous contact process on
$G_k\cup \mathcal{C}_r$
where
$\rho$
is initially infected. Then, for S as in (5.14) with
$\epsilon = {\frac{5}{16}}$
and for any
$\tilde{S}\in [S/2, S]$
and either f or k large enough, on the event
$\{ \mathcal{F}_{ u_{r}} \geq f, \mathcal{F}_{\rho} \geq f\}$
,
where
The terms S,
$C_{\lambda,f}$
, and
$R(f,k,\lambda)$
are defined in (5.14), (5.1), and (5.16), respectively.
Proof. Let
$m \,:\!=\, \lfloor \tilde{S}(2r+1)^{-1} \rfloor$
and
$m_0 \,:\!=\, \lceil f \kern0.5pt k^{2/3}(2r+1)^{-1} \rceil$
. Since either f or k is large enough, we can assume that
$f \kern0.5pt k^{2/3}\le S/4$
and w.l.o.g.
$m_0\le m$
. Here we use the notation
$\mathbb{P} ( \!\cdot\! )\,:\!=\, \mathbb{P} (\! \cdot \! | \ \mathbb{F})$
and we add the subscript
$\mathbb{P}_{(0,1)}$
when only the root is initially infected. Begin by noting that
where
and
$|\Lambda_t|$
is the number of infected leaves of
$\rho$
at time t. From Lemma 8, we know, for f and k large enough, that
where
$R(f,k,\lambda)$
is defined in (5.16). The proof is thus complete as soon as we can show that, for f and r sufficiently large,
Define the sequence of times
$t_0=0$
and
$t_i=(2r+1)i$
for
$i \in \{1,\dots, m\}$
. For fixed
$i \in \{0,\dots, m-1\}$
, let us define
$\tau_i \,:\!=\, \inf\{u\ge t_i\,:\, \rho \in X_u \} $
,
Thus, with this notation we have
\begin{equation*} \mathbb{P}_{(0,1)} ({u_{r}}\notin X_{s}\ \text{for all}\ s \in[0,m(2r+1)] ,\, \mathcal{B} ) \leq \mathbb{P}_{(0,1)}\Bigg (\bigcap_{i=m_0}^{m-1}A_i, \bigcap_{i=m_0}^{m-1}B_{\tau_i} \Bigg ). \end{equation*}
Since
$\mathcal{B}_{\tau_i}\in \mathcal{F}_{\tau_i}$
,
$\tau_i$
is
$\mathcal{F}_{\tau_i}$
-measurable and
$\mathcal{F}_{t_i}\subset \mathcal{F}_{\tau_i}$
, we deduce
\begin{align*} \mathbb{P} (u_{r}\in X_{s}\ \text{for some}\ s & \in[t_i,t_{i+1}] \ \big|\big. \ B_{\tau_i}, \ \mathcal{F}_{t_i} ) \\ & \ge \mathbb{P} (\{u_{r}\in X_{s}\ \text{for some}\ s \in[\tau_i,t_{i+1}]\} \cap \{\tau_i\leq t_{i}+1\} \ \big|\big. \ B_{\tau_i}, \ \mathcal{F}_{t_i} ) \\ & \geq \mathbb{E} \big( \mathbf{1}_{\{ \tau_i \leq t_i+1 \} } \mathbb{P} \big(u_{r}\in X_{s}\ \text{for some}\ s \in[\tau_i,\tau_i + 2r ] \ \big|\big. \ \mathcal{F}_{\tau_i}\big) \, \big|\big. \, B_{\tau_i} , \, \mathcal{F}_{t_i}\big). \end{align*}
Now note that, by an application of the strong Markov property and monotonicity, we obtain
where we used Lemma 3 together with the fact that
$1-\mathrm{e}^{-\gamma} \leq 1-\mathrm{e}^{-\gamma r} $
holds for
$r\geq 1$
in the last step. In addition, under
$B_{\tau_i}$
, the probability that
$\tau_i \leq t_i+1$
is bounded from below by the probability that one of the L exponential clocks with rate
$\lambda \vartheta f$
attached to the leaves rings before time 1, i.e.
Combining the estimates, we have that
Therefore, by the tower property,
\begin{align*}\begin{aligned} \mathbb{P}_{(0,1)}\Bigg( & \bigcap_{i=m_0}^{m-1}A_i \cap B_{\tau_i} \Bigg)\\ & = \mathbb{E}_{(0,1)} \Big( \mathbf{1}_{\bigcap_{i=m_0}^{m-2} A_{i}\cap B_{\tau_i}} \mathbb{P} (u_{r}\not\in X_{s}\ \text{for all}\ s \in[t_{m-1},t_{m}] , B_{\tau_{m-1}} \big|\big. \ \mathcal{F}_{t_{m-1}} )\Big ) \\ & \leq \mathbb{E}_{(0,1)}\Big( \mathbf{1}_{\bigcap_{i=m_0}^{m-2} A_{i}\cap B_{\tau_i}} \mathbb{P} (u_{r}\not\in X_{s}\ \text{for all}\ s \in[t_{m-1},t_{m}] \big|\big. \ B_{\tau_{m-1}} ,\mathcal{F}_{t_{m-1}} ) \Big). \end{aligned}\end{align*}
Using the previous bound and iterating,
\begin{align*} \mathbb{P}_{(0,1)} ({u_{r}}\notin X_{s}\ \text{for all}\ s \in[0,m(2r+1)] , \mathcal{B} ) & \leq \prod_{i=m_0}^{m-1} \big(1- (1-\mathrm{e}^{-\lambda \vartheta fL})(1-\mathrm{e}^{-\gamma})C_{\lambda, f}\widehat{\lambda}^r\big)\\ & \leq \big (1- \widehat C_{\lambda, f}\widehat{\lambda}^r\big )^{m-m_0}. \end{align*}
Thus, the desired result follows, since
$m-m_0\ge S/4(2r+1)-1$
.
6. Proof of Theorem 2
The proof of the theorem follows a similar overall structure to those in [Reference Pemantle17, Theorem 3.2] and, afterwards, [Reference Huang and Durrett11, Theorem 1.4]. However, the presence of fitness turns out to lead to significant changes throughout the whole proof. The proof is long and we break it up into several lemmas. The general idea is to push the infection to stars in a suitably chosen generation and then bring the infection back to the root.
In the first lemma, we estimate from below the mean of the number of stars in a given generation. To do so, we first introduce some notation. Note that we can choose
$\vartheta > 0$
small enough that
By monotonicity, we can also assume that this
$\vartheta$
is such that Condition (
B
) also holds for this choice. Throughout the remainder of the section, we fix this
$\vartheta>0$
. Let
$f\ge \vartheta$
be a real number and
${k\ge 7}$
a natural number. In what follows, we assume that either f or k is sufficiently large that the results of the previous section hold. Let
where
$|\cdot |$
denotes the cardinality of the set and
$V_1$
the set of vertices in generation 1, as defined in (3.1).
Let
$r\ge 1$
be a natural number. Denote by
$\mathcal{G}_r$
and
$\mathcal{A}_{f,k}^r$
the set of good vertices and k-stars in generation r in
$(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
, i.e.
and
where
$\xi_v^{\vartheta} = \sum_{w \in c(v)} \mathbf{1}_{\{ \mathcal{F}_w \geq \vartheta\}}$
, for c(v) the set of children of v. We note for later that the conditional distribution of
$\xi_v^{\vartheta}$
given the tree up to generation r is the same as that of
\begin{equation} \xi^\vartheta \,:\!=\, \sum_{i=1}^{\xi} I_i,\end{equation}
with
$I_1, I_2, \dots $
Bernoulli random variables with success probability
$\mathbb{P}(\mathcal{F}\geq \vartheta)$
.
Lemma 10. Let
$r\ge 2$
. Denote by
$Z_r$
the number of k-stars in generation r in
$(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
. Then
where
$\mu_\vartheta$
and
$\xi^\vartheta$
are defined in (6.1) and (6.3), respectively.
Proof. We assume from now on that
$\mathbb{P}$
refers to the conditional probability measure, given
$A_{f,k}^{\rho}$
. Denote by
$\mathbb{T}_{\le r}$
and
$\mathbb{F}_{\le r}$
the
$\sigma$
-algebras generated by the BGW tree and the fitness values up to generation r, respectively. We also denote by c(v) the set of children of vertex
$v\in V(\mathcal{T}\kern2.6pt)$
. We begin by noting that
\begin{align*}\begin{split} \mathbb{E}\big[Z_r \mid \mathbb{T}_{\le r+1},\, \mathbb{F}_{\le r}\big] &= \sum_{v\in \mathcal{G}_r} \mathbf{1}_{\{\mathcal{F}_v\ge f\} } \mathbb{E}\big[\mathbf{1}_{\{\xi_v^\vartheta = k\}} \mid \mathbb{T}_{\le r+1},\, \mathbb{F}_{\le r}\big] \\ &= \sum_{w\in \mathcal{G}_{r-1}} \sum_{v \in c(w)} \mathbf{1}_{\{\mathcal{F}_v\ge f\} } \mathbb{E}\big[\mathbf{1}_{\{\xi^\vartheta_v = k\}} \mid \xi_v \big]. \end{split}\end{align*}
Now, using the tower property yields
\begin{align*}\begin{split} \mathbb{E} [Z_r \mid \mathbb{T}_{\le r},\, \mathbb{F}_{\le r-1} ] &= \mathbb{E}\big[\mathbb{E}\big[Z_r \mid \mathbb{T}_{\le r+1},\, \mathbb{F}_{\le r}\big]\mid \mathbb{T}_{\le r},\, \mathbb{F}_{\le r-1} \big] \\ &= \sum_{w\in \mathcal{G}_{r-1}} \sum_{v \in c(w)} \mathbb{E}\big[ \mathbf{1}_{\{\mathcal{F}_v\ge f\} } \mathbb{E}[ \mathbf{1}_{\{\xi^\vartheta_v = k\}} \mid \xi_v] \mid \mathbb{T}_{\le r},\, \mathbb{F}_{\le r-1} ] \big] \\ &= \sum_{w\in \mathcal{G}_{r-1}} \xi_w \mathbb{P}(\xi^\vartheta= k, \, \mathcal{F} \ge f). \end{split}\end{align*}
Thus, once again appealing to the tower property, we get
\begin{align*}\begin{split} \mathbb{E} [Z_r \mid \mathbb{T}_{\le r-1},\, \mathbb{F}_{\le r-2} ] &= \sum_{u\in \mathcal{G}_{r-2}} \sum_{w \in c(u)} \mathbb{E}[\xi \mathbf{1}_{\{\mathcal{F}\ge \vartheta\}}]\mathbb{P}(\xi^\vartheta= k, \, \mathcal{F} \ge f)\\ &= \sum_{u\in \mathcal{G}_{r-2}} \xi_u\mathbb{E} [\xi \mathbf{1}_{\{\mathcal{F}\ge \vartheta\}} ]\mathbb{P}( \xi^\vartheta= k, \, \mathcal{F} \ge f). \end{split}\end{align*}
Recursively, we deduce
Therefore,
where in the last inequality we have used that we are working on the probability measure conditional on the event
$A_{f,k}^{\rho}$
, which states that the set of children of
$\rho$
with
$\xi_v\ge 1$
and
$\mathcal{F}_v\ge \vartheta$
has cardinality k.
Now we need the following two lemmas, which can be found in [Reference Pemantle17, Lemmas 2.3 and 3.4]. The first lemma gives a lower bound for the probability that a binomial random variable is at least 1. The second lemma gives a necessary condition for
$\liminf_{t\to\infty}g(t)$
to be positive, where g is a function on the non-negative real numbers.
Lemma 11. ([Reference Pemantle17, Lemma 2.3].) Let M be a positive integer-valued random variable and pick
$p<\mathbb{E} [M]$
. For any
$x\in (0,1]$
, let
$M_x$
be a random variable with binomial distribution Bin(M, x). Then there exists
$\delta >0$
such that
Lemma 12. ([Reference Pemantle17, Lemma 3.4].) Let G be any non-decreasing function on
$[0,\infty)$
such that
$G(x)\geq x$
on some neighbourhood of 0. Suppose that g is a function on
$[0,\infty)$
that satisfies, for some
$S>0$
,
Then
To prove Theorem 2, we first aim to show that, for any
$\lambda>0$
, we have
$\liminf_{t \to \infty}\mathbb{P}(\rho \in X_t)>0$
, where we average over the tree
$(\mathcal{T},\mathbb{F}(\mathcal{T\,\,}))$
. As explained next, this immediately implies that
$\lambda_2 = 0$
.
Now, our strategy is to apply Lemma 12 to the function
The next step is to find a non-decreasing function G that satisfies (6.4). In the following lemma, we do so under a technical condition that is implied by Assumption ( B ), as we show later on.
Lemma 13. For
$\epsilon = {\frac{5}{16}}$
, suppose that S,
$ \widehat{C}_{\lambda, f}$
, and
$\widehat{\lambda}$
are as defined in (5.14) and (5.18), respectively. Assume that there exists
$r = r(f,k)\ge 2$
, such that
For either f or k large enough there exists a constant
$c\in(0,1)$
and
$\delta>0$
such that if we define
then it holds that
Proof. Throughout this proof, fix
$\lambda > 0$
. From now on, we assume that
$\mathbb{P}$
refers to the conditional probability measure, given
$A_{f,k}^{\rho}$
. Also, it must be emphasised that we always start with the root initially infected (unless specified otherwise). We first prove that, conditionally on
$v\in V_r$
being a star, then it will be infected before time S with probability bounded away from zero uniformly for either f or k large enough. That is to say, there exists a positive constant
$c_1$
such that for either f or k sufficiently large and any
$v \in {\mathcal{A}_{f,k}^r}$
,
The proof of this bound follows by an application of Lemma 9, by using the monotonicity of the inhomogeneous contact process restricted to the subgraph consisting of a star with root
$\rho$
together with a path
$\mathcal{C}_r$
from one descendant of the root to v. Indeed, for either f or k sufficiently large, we obtain
where the function
$R(f,k,\lambda)$
is defined in (5.16). Then, using the inequality
$(1-x)^{1/x}< \mathrm{e}^{-1}$
, observe that (6.5) forces the first term on the right-hand side of the last equation to be at most
$\mathrm{e}^{-2}$
, i.e.
Further, for either f or k sufficiently large, we have
$R(f,k,\lambda)\leq 1/2$
. Therefore, we deduce that
$p_\mathrm{in}$
is bounded away from 0 for either f or k large enough, i.e.
In other words, with positive probability, we push the infection to a generation r that satisfies Condition (6.5).
Now, conditioning on the event that
$v\in X_{t-{S}}$
for some
$v\in {\mathcal{A}_{f,k}^r}$
, we deduce the following lower bound, for
$t>S$
:
where the functions
$H_1$
and
$H_2$
are given by
Hence, the next goal is to establish lower bounds for the functions
$H_1$
and
$H_2$
.
Lower bound for
$H_1$
. Denote by
$Z_r= |\mathcal{A}_{f,k}^r|$
the number of k-star vertices in generation r. Taking into account that we are working conditionally on the event
$A_{f,k}^{\rho}$
, we have from Lemma 10 that
Let
$M_r^S$
be the random number of k-stars in generation r that are infected before time S. Together with (6.7), this estimate is sufficient to obtain
\begin{align} \mathbb{E} \big[M_r^S\big]&\geq \mathbb{E}\Bigg[ \sum_{v \in \mathcal{A}_{f,k}^r} \mathbb{P}_{\mathcal{T}, \mathbb{F}} \big( v \in X_s \mbox{ for some } s \in [0,S]\big) \Bigg] \notag \\ & \geq c_1 \mathbb{E}[ Z_r] \geq c_1 k \mu^{r-2}_{\vartheta}\mathbb{P} (\xi^\vartheta=k, \,\mathcal{F}\geq f ). \end{align}
Let us define, for
$t>2S$
,
Now, ignore all the infections of
$v\in \mathcal{A}_{f,k}^r$
by its parent except the first infection. Then the contact process on the subtrees rooted at vertices
$v\in \mathcal{A}_{f,k}^r$
, which are infected at some time
$s<S$
, will evolve independently from time s to time
$t-S$
and then vertex v will be infected with probability at least
$\chi(t)$
. Therefore, if we denote by
$M_r^{t-S}$
the random number of k-stars in generation r that are infected at time
$t-S$
, we can conclude that the random variable
$M_r^{t-S}$
stochastically dominates a random variable
$M_\chi$
that has distribution Bin
$\big(M_r^S,\chi(t)\big)$
. By Lemma 11 and (6.9), there exists
$\delta_1 >0$
such that
Note that the factor
$2^{-1}$
is required to guarantee the hypotheses of Lemma 11. Moreover, since
$M_r^{t-S}$
dominates the random variable
$M_\chi$
, we obtain that, for
$t>2S$
,
which implies, for
$t>2S$
,
Lower bound for
$H_2$
. Let
$t>S$
. We break
$H_2(t)$
down into a product of conditional probabilities as follows:
where
\begin{align*} h(t)&= \mathbb{P} (\rho \in X_s \ \text{for some}\ s\in [t-S,t-f \kern0.5pt k^{2/3}-1]\ | \ v \in X_{t-S}\ \text{for some}\ v\in \mathcal{A}_{f,k}^r ), \\ \widehat{h}(t)&= \mathbb{P} (\rho \in X_t \ | \ \rho \in X_s \ \text{for some}\ s\in [t-S,t-f \kern0.5pt k^{2/3}-1],\ v\in X_{t-S}\ \text{for some}\ v\in \mathcal{A}_{f,k}^r ). \end{align*}
We can lower bound h(t) by ignoring all the possible infections other than the infection of v at time
$t-S$
; we have
where
$\mathbb{P}_{\{v\}}$
denotes the law of the process with v initially infected. Moreover, by ignoring one child of v and considering the star of size k centred at v, the same argument applies as before and we deduce that
where the constant
$c_1$
is the same as in (6.7) and comes from Assumption (6.5).
Conversely, once again by monotonicity of the contact process, we have, for
$t>S$
,
Let us now introduce the stopping time for X,
Recall that
$\epsilon = {\frac{5}{16}}$
. For the event
$\{\tau\leq t-f \kern0.5pt k^{2/3}-1\}$
, let
$\mathcal{B}_\tau$
be the event that the number of infected neighbours of
$\rho$
is at least
$\epsilon L$
in the entire random time interval
$[\tau+f \kern0.5pt k^{2/3}, t-1]$
, i.e.
where we recall that
$\Lambda_u$
is the set of infected leaves of
$\rho$
at time u. Denote by
$\mathscr{F}_t$
the
$\sigma$
-algebra generated by tree, fitness, and the contact process up to time t. Then, appealing to the strong Markov property and Lemma 8 and using
$\tau \geq t-S$
, we obtain
where the function
$R(f,k,\lambda)$
is defined in (5.16). Next, define
$\mathcal{I}$
to be the event that at least one of the
$\epsilon L$
neighbours that is infected at time
$t-1$
infects the root at a time in
$[t-1,t]$
before recovering.
Denote by
$x_1, \dots, x_{\lceil \epsilon L\rceil}$
the infected neighbours at time
$t-1$
. We can estimate the probability of
$\mathcal{I}$
as
\begin{align*} \mathbb{P}(\mathcal{I} \mid \mathcal{F}_{t-1}) &\geq 1- \prod_{i=1}^{\lceil \epsilon L\rceil} \mathbb{P}(\{x_i\ \text{recovers}\ \text{in}\ [t-1,t]\}\cup \{x_i\ \text{does not infect}\ \rho \ \text{in}\ [t-1,t]\})\\ & = 1- \prod_{i=1}^{\lceil \epsilon L \rceil}(1- \mathbb{P}(\{x_i\ \text{does not recover}\ \text{in}\ [t-1,t]\}\cap \{x_i\ \text{infects}\ \rho \ \text{in}\ [t-1,t]\})\\ & \ge 1 - \prod_{i=1}^{\lceil \epsilon L \rceil} (1- \mathrm{e}^{-1}(1-\mathrm{e}^{-\lambda f \vartheta})) \geq 1- (1-\mathrm{e}^{-1}(1-\mathrm{e}^{-\lambda f \vartheta}))^{\epsilon L}\,=\!:\, 1 - a(f,k, \lambda). \end{align*}
Also, note that
$\mathbb{P}(\mathcal{R}_\rho | \ \mathscr{F}_{t-1})\geq \mathrm{e}^{-1}$
, where
$\mathcal{R}_{\rho}=\{\rho \ \text{does not recover in}\ [t-1,t]\}.$
With this notation, we have the following estimate:
Conditioning on
$\mathscr{F}_{t-1}$
and using the independence of the infection and recovery events, we obtain that
\begin{align*} \mathbb{P} (\mathcal{I}\cap \mathcal{R}_{\rho}\cap \mathcal{B}_\tau\cap \{\tau \leq t-f \kern0.5pt k^{2/3}-1\} ) &=\mathbb{E} [\mathbb{P}(\mathcal{I}\cap \mathcal{R}_\rho | \mathscr{F}_{t-1})\mathbf{1}_{\{\mathcal{B}_\tau, \tau\leq t-f \kern0.5pt k^{2/3}-1\}} ] \\ & = \mathbb{E}\big[\mathbb{P}(\mathcal{I}|\mathscr{F}_{t-1})\mathbb{P}(\mathcal{R}_\rho|\mathscr{F}_{t-1})\mathbf{1}_{\{\mathcal{B}_\tau, \tau\leq t-f \kern0.5pt k^{2/3}-1}\} \big] \\ &\geq (1 - a(f,k, \lambda) ) \mathrm{e}^{-1}\mathbb{E}\big[\mathbb{P}(\mathcal{B}_\tau |\mathscr{F}_{\tau})\mathbf{1}_{\{\tau\leq t-f \kern0.5pt k^{2/3}-1}\}\big]. \end{align*}
Combining with the previous estimates, we get the lower bound
Denote by
$c_2$
the expression
Observe that this expression depends on
$\lambda, f$
, and k; however, we see that
$c_2\to \mathrm{e}^{-1}$
as
$k\to \infty$
and f is fixed and
$c_2\to \mathrm{e}^{-1}(1-\mathrm{e}^{-1})^{\epsilon\lceil k/2\rceil}$
as
$f\to \infty$
and
$k\geq 7$
fixed. In other words, in our two relevant cases we can lower bound
$c_2$
by a constant. The previous lower bounds for h and
$\widehat{h}$
give, for
$t>S$
Substituting (6.10) and (6.11) back into (6.8), we now see that, for
$t>2S$
,
where
$c=2^{-1}c_1^2c_2 \in (0,1)$
. Hence, under the assumption that r satisfies Condition (6.5), we establish the following lower bound
\begin{equation*} g(t)\geq \begin{cases} c k \mu^{r-2}_{\vartheta}\mathbb{P}\left(\xi^\vartheta=k, \, \mathcal{F}\geq f\right)\chi(t) \wedge \delta_1,& t>2S \\ \displaystyle \inf_{0 \leq s \leq 2S} g(s), & S \leq t \leq 2S. \end{cases} \end{equation*}
Furthermore, note that
Therefore, these two estimate are sufficient to deduce that there exists
$\delta >0$
such that
thus completing the proof.
The following final preparatory lemma gives us an equivalent formulation of Hypothesis (
B
) which is easier to use in our final proof. Further, in the case of unbounded fitness, we prove that (
B
) implies the analogue condition for
$\xi^\vartheta$
defined in (6.3), which is also needed in the last proof.
Lemma 14. Condition ( B ) is equivalent to
\begin{equation} \limsup_{\substack{f+k\to \infty\\ \, {k\ge 7}, \, f\ge \vartheta}} \frac{\log (\mathbb{P}(\xi=k, \, \mathcal{F} \geq f) )}{k\log\! (1 +f)}= 0. \end{equation}
Furthermore, Condition (
B
) implies (6.12) but with
$\xi^\vartheta$
instead of
$\xi$
, where
$\xi^\vartheta$
is defined in (6.3).
Proof. Let
$k\ge 7$
and
$f\ge \vartheta$
. First, we assume that (
B
) does not hold, i.e.
Now, we note that
which implies
\begin{align*}\begin{split} \limsup_{\substack{f+k\to \infty\\ {k\ge 7}, \, f\ge \vartheta}} \frac{\log (\mathbb{P}(\xi=k, \, \mathcal{F} \geq f) )}{k\log\! (1+f)} \leq \limsup_{\substack{f+k\to \infty\\ {k\ge 7}, \, f\ge \vartheta}} \frac{\log( (1+f)^{-ck} \mathbb{E}[(1+\mathcal{F}\,)^{c\xi}\mathbf{1}_{\{ {\xi\ge 7}, \, \mathcal{F}\ge \vartheta\}}])}{k \log\! (1+f)}=-c. \end{split}\end{align*}
In other words, we have shown that
\begin{equation} \limsup_{\substack{f+k\to \infty\\ \, {k\ge 7}, \, f\ge \vartheta}} \frac{\log (\mathbb{P}(\xi=k, \, \mathcal{F} \geq f) )}{k\log\! (1 +f)}= -\delta, \,\, \text{for some} \ \delta\in (0,\infty]. \end{equation}
Now, assume that (6.14) holds. Then there exist
$\delta>0$
and
$C>0$
such that
We choose
$c\in (0,\delta)$
small enough, such that
$2^c(1+\vartheta)^{c-\delta}<1$
. Now for some
$k_0$
such that
$(\delta-c)k_0>1$
, we observe that the following inequalities hold:
\begin{align*} \mathbb{E} [(1+\mathcal{F}\,)^{c\xi}\mathbf{1}_{\{\xi\geq k_0, \, \mathcal{F}\geq \vartheta\}} ] &\leq \sum_{k=k_0}^{\infty} \sum_{f= 0}^\infty \mathbb{E} [(1+\mathcal{F}\,)^{c\xi}\mathbf{1}_{\{\mathcal{F}\in [f+\vartheta, f+\vartheta+1)\}\cap \{\xi= k\}} ] \\ & \leq \sum_{k=k_0}^{\infty} \sum_{f= 0}^\infty (2+\vartheta+f)^{ck}\mathbb{P}(\xi =k, \, \mathcal{F}\geq f+\vartheta)\\ & \leq C\sum_{k=k_0}^{\infty} \sum_{f= 0}^\infty (2^c(1+\vartheta+f)^{-(\delta-c)} )^k \\ & = C\sum_{f= 0}^\infty \frac{2^{ck_0}(1+\vartheta+f)^{-(\delta-c) k_0}}{1-2^c(1+\vartheta+f)^{-(\delta-c)}}\\ & \le \frac{C\, 2^{ck_0}}{1-2^c(1+\vartheta)^{c-\delta}}\sum_{f= 0}^\infty (1+\vartheta+f)^{- (\delta-c) k_0} < \infty, \end{align*}
where in the third inequality we used that
$(2+\vartheta+f)^{ck}\le 2^{ck} (1+\vartheta+f)^{ck}$
and in the equality we get a geometric sum that converges, since
$2^c(1+\vartheta+f)^{c-\delta}\le 2^c(1+\vartheta)^{c-\delta}$
for all
$f\ge 0$
. Conversely,
\begin{align*} \mathbb{E} [(1+\mathcal{F}\,)^{c\xi}\mathbf{1}_{\{{7\le \xi}\leq k_0, \, \mathcal{F}\geq \vartheta\}} ] &\leq \sum_{k=7}^{k_0} \int_0^\infty \mathbb{P}((1+\mathcal{F}\,)^{ck}\ge x, \, \xi =k, \, \mathcal{F}\ge \vartheta) \,\mathrm{d} x \\ & = \sum_{k=7}^{k_0}\int_{0}^{(1+\vartheta)^{ck}} \mathbb{P}(\xi =k, \, \mathcal{F}\ge \vartheta) \,\mathrm{d}x \\ & \quad + \sum_{k=7}^{k_0}\int_{(1+\vartheta)^{ck}}^\infty \mathbb{P}(\xi =k, \, \mathcal{F}\ge x^{1/ck}-1) \, \mathrm{d}x \\ & \le k_0 (1+\vartheta)^{ck_0} + C\sum_{k=7}^{k_0}\int_{1}^\infty x^{-\delta/c} \,\mathrm{d}x <\infty, \end{align*}
where in the last inequality we have used (6.15). Thus we get that (6.13) holds.
For the second claim, first suppose that the
$\limsup$
in (6.12) is achieved along a sequence
$(f_n,k_n)$
such that
$f_n \rightarrow \infty$
. Then, we see that
\begin{align*}\begin{split} \mathbb{P}(\xi^\vartheta = k_n,\ & \mathcal{F}\ge f_n) = \sum_{\ell=1}^{\infty} \mathbb{P}\Bigg( \sum_{i=1}^{\ell} I_i = k_n \Bigg) \mathbb{P}(\xi =\ell, \, \mathcal{F}\ge f)\\ &\geq \mathbb{P}\Bigg(\sum_{i=1}^{k_n} I_i = k_n\Bigg) \mathbb{P}(\xi= k_n, \, \mathcal{F}\ge f_n) = \mathbb{P}(\mathcal{F}\geq \vartheta)^{k_n} \mathbb{P}(\xi =k_n, \, \mathcal{F}\ge f_n). \end{split}\end{align*}
Hence,
\begin{align*}\begin{split} \limsup_{\substack{f+k\to \infty\\ \, {k\ge 7}, \, f\ge \vartheta}} \frac{\log \big(\mathbb{P}(\xi^{\vartheta}=k, \, \mathcal{F} \geq f)\big)}{k\log\! (1+f)} \geq \lim_{n \rightarrow \infty} \frac{\log \big(\mathbb{P}(\mathcal{F}\geq \vartheta)^{k_n}\mathbb{P}(\xi=k_n, \, \mathcal{F}\geq f_n)\big)}{k_n\log\! (1+f_n)}=0, \end{split} \end{align*}
where in the last equality we have that
$f_n \rightarrow \infty$
.
Now, suppose that the
$\limsup$
in (6.12) is achieved along a sequence
$(f_n,k_n)$
such that
$k_n \rightarrow \infty$
. Set
$p = \mathbb{P}(\mathcal{F} \geq \vartheta)$
. Then, we define
$k_n^* \in \mathbb{N}$
such that
$pk_n \leq k_n^* < p k_n + 1$
, so that
$\lfloor k_n^*/p \rfloor = k_n$
. Similarly to before, we estimate
\begin{align*}\begin{split} \mathbb{P}(\xi^\vartheta = k_n^*, \, \mathcal{F}\ge f_n) &\geq \mathbb{P}\Bigg(\sum_{i=1}^{k_n} I_i = k_n^*\Bigg) \mathbb{P}(\xi= k_n, \, \mathcal{F}\ge f_n) . \end{split}\end{align*}
Now, since
$I_i$
are independent Bernoulli (p) random variables, by the de Moivre–Laplace theorem, we have that, for
$k_n$
large, there exists
$c > 0$
such that
\begin{align*} \mathbb{P}\Bigg(\sum_{i=1}^{k_n} I_i = k_n^*\Bigg) = \frac{(1+o(1))}{\sqrt{p(1-p)k_n}} \exp\big\{\!- (k_n^* - p k_n)^2 / \sqrt{k_np(1-p)}\big\} \geq \frac{c}{\sqrt{k_n}} . \end{align*}
Thus, combining these estimates, we get that
as
$n\to \infty$
, which completes the proof.
With the previous preparatory lemmas in hand, we are now ready to prove Theorem 2.
Proof of Theorem
2. Throughout this proof, fix
$\lambda > 0$
. We assume that
$\mathbb{P}$
refers to the conditional probability measure, given
$A_{f,k}^{\rho}$
, and as the latter event has positive probability it suffices to show that
$\liminf_{t \rightarrow \infty} \mathbb{P}(\rho \in \xi_t)> 0$
under the conditional probability measure.
We would like to use Lemma 12 applied to the non-negative and non-decreasing function G defined in (6.6). First, observe that
Thus, we have that g satisfies the first condition of Lemma 12. Now we want to apply Lemma 13 with the following choice of r:
\begin{equation} r ={r(f,k)=} \Bigg\lceil -\frac{\log\big(\mu^{-2}_{\vartheta} c k\mathbb{P}(\xi^\vartheta =k, \, \mathcal{F}\geq f)\big) }{\log \mu_\vartheta} \Bigg\rceil. \end{equation}
We can see that, as
$\mathbb{E}[\xi^\vartheta]<\infty$
, we have by dominated convergence that
as either
$k \to \infty$
or
$f \to \infty$
. Therefore, in either case
$r = r(f,k)\rightarrow \infty$
. Moreover, we have
$c k \mu^{r-2}_{\vartheta} \mathbb{P}\left(\xi^\vartheta =k, \, \mathcal{F}\geq f\right)\geq 1$
, and this in turn implies that
$G(x)\geq x$
for some neighbourhood of 0. We complete our argument by showing that, under the hypothesis of the theorem, we can find f and k such that (6.5) holds. This allows us to apply Lemma 13 together with Lemma 12 to obtain
first when conditioning on
$A_{f,k}^\rho$
, but, since this event has positive probability, also without conditioning. Now by the reverse Fatou lemma, we conclude that
which means that the process survives strongly.
It remains to show that (6.5) holds. We begin by noting that Condition (6.5) is implied by
Indeed, since
$\widehat{\lambda}<1$
, the right-hand side in (6.5) goes to infinity as
$r\to \infty$
so that we can ignore the
$-1$
on the left-hand side of (6.5). Now, since
$C_{\lambda, f}\geq 1$
, we see from the definition of S given in (5.14) with
$\epsilon={\frac{5}{16}}$
, that
implies Condition (6.17). Recall that
$\epsilon = {\frac{5}{16}}$
, so the latter inequality is equivalent to
Taking into account that by the definition of L given in (5.6),
$f \kern0.5pt L \rightarrow \infty $
as either
$k \rightarrow \infty$
or
$f\rightarrow \infty$
, we have
It follows that (6.17) holds if
As this condition is equivalent to
it suffices to show that
$\Delta(f_n,k_n) \rightarrow - \infty$
, for suitably chosen
$f_n,k_n$
, to complete the proof.
By Assumption (
B
) and Lemma 14, we have that there exists a sequence
$(f_n, k_n)_{n\geq 1}$
such that
$f_n + k_n \to \infty $
and
Note that either

Therefore,
Thus, we can deduce from the definition of r in (6.16) that
$\Delta(f_n,k_n) \to -\infty$
if
which now follows again by (6.20) directly from (6.19). This, shows that for this choice of
$(f_n,k_n)$
we can guarantee that for n large enough
$\lambda > \mathrm{e}^{ \Delta(f_n,k_n)}/(\vartheta^2 (1 - \mathrm{e}^{ \Delta(f_n,k_n)}))$
, so that Condition (6.17) holds and the process survives strongly.
Acknowledgements
The authors thank the anonymous referee and the editor for their detailed comments and suggestions, which helped to improve this article. N.C.-T. acknowledges support from CONACyT-MEXICO (grant no. 636133). This manuscript was partially prepared while N.C.-T. was visiting the Department of Mathematical Sciences at the University of Bath, and she is grateful for the hospitality and collaboration. N.C.-T. acknowledges support from SAMBa (Statistical Applied Mathematics at Bath) and the Dorothea Schlözer-Programm at Georg-August-Universität Göttingen.
Funding information
There are no funding bodies to thank relating to the creation of this article.
Competing interests
There are no competing interests to declare, which arose during the preparation or publication process of this article.