This paper proves that the scaled infection process in a critical partner model converges to a diffusion process, providing a detailed understanding of the epidemic's extinction time at the critical threshold.
Contribution
It establishes the convergence of the scaled infection process to a diffusion and analyzes the extinction time in the critical regime, improving previous results.
Findings
01
The infection process converges to a limiting diffusion.
02
The extinction time has a well-defined limit.
03
The process collapses to two dimensions rapidly.
Abstract
The partner model is an SIS epidemic in a population with random formation and dissolution of partnerships, and with disease transmission only occuring within partnerships. Foxall, Edwards, and van den Driessche found the critical value and studied the subcritical and supercritical regimes. Recently Foxall has shown that (if there are enough initial infecteds I0β) the extinction time in the critical model is of order Nβ. Here we improve that result by proving the convergence of iNβ(t)=I(Nβt)/Nβ to a limiting diffusion. We do this by showing that within a short time, this four dimensional process collapses to two dimensions: the number of SI and II partnerships are constant multiples of the the number of infected singles. The other variable, the total number of singles, fluctuates around its equilibrium like an Ornstein-Uhlenbeck process of magnitudeβ¦
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Diffusion limit for the partner model at the critical value
Anirban Basak, Rick Durrett, and Eric Foxall
Abstract
The partner model is an SIS epidemic in a population with random formation and dissolution of partnerships, and with disease transmission only occuring within partnerships. Foxall, Edwards, and van den Driessche [7] found the critical value and studied the subcritical and supercritical regimes. Recently Foxall [4] has shown that (if there are enough initial infecteds I0β) the extinction time in the critical model is of order Nβ. Here we improve that result by proving the convergence of iNβ(t)=I(Nβt)/Nβ to a limiting diffusion. We do this by showing that within a short time, this four dimensional process collapses to two dimensions: the number of SI and II partnerships are constant multiples of the the number of infected singles. The other variable, the total number of singles, fluctuates around its equilibrium like an Ornstein-Uhlenbeck process of magnitude Nβ on the original time scale and averages out of the limit theorem for iNβ(t). As a by-product of our proof we show that if ΟNβ is the extinction time of iNβ(t) (on the Nβ time scale) then ΟNβ has a limit.
1 Introduction
In the partner model each of N individuals can be susceptible or infected and in a partnership or not. So the system is described
by the five quantities Stβ and Itβ, the number of single susceptible and infected individuals, and SStβ, SItβ, and IItβ, the number of partnered pairs of the three possible combinations, at time t.
Infected individuals become healthy (and susceptible to re-infection) at rate 1. A susceptible individual with an infected partner
becomes infected at rate Ξ». Partnerships dissolve at rate rββ. Each pair of single individuals forms a partnership at rate r+β/N.
Foxall, Edwards, and van den Driessche [7] introduced this model and showed that despite the complexity of the model it is possible to find the critical value explicitly. To do this they used the continuous time Markov chain Xtβ with state space {A,B,C,D,E,F,G} and rates as shown in Figure 1. Thinking of a single infected individual in an otherwise susceptible population, we start in state A, and let Ο be the first time Xtβ enters {D,E,F,G}. The basic reproduction number for the model is
[TABLE]
which is the expected number of infected singles at time Ο. The critical value of Ξ» is
[TABLE]
with Ξ»cβ<β if and only if r+β>1+1/rββ. There is an explicit formula for Ξ»cβ but it is not very pretty since the
formulas for the hitting probabilities are somewhat complicated.
If R0β<1 there are constants T, C so that, from any initial configuration, with high probability the process dies out by time T+ClogN. If R0β>1, then for any Ο΅>0 there are constants T, C, Ξ³, such that from any initial configuration with at least Ο΅N infected, with probability at least 1βeβΞ³N the process survives for time eΞ³N and the frequencies of the five types stβ=Stβ/N,itβ=Itβ/N, etc. are within Ο΅ of their equilibrium values (sββ,iββ,ssββ,siββ,iiββ) when Tβ€tβ€eΞ³N.
To describe the equilibrium values we need some notation.
Let Ytβ=Stβ+Itβ be the number of single individuals and ytβ=Ytβ/N. ytβ approaches and remains close to a stationary value yββ
which is the unique equilibrium in (0,1) for the ODE
[TABLE]
We will explain this result in more detail later, see (14). The equilibrium frequency of singles, yββ,
is the solution of rββ(1βyββ)=r+βyβ2β.
To find the number of single infecteds in equilibrium we let itβ=Itβ/N and note the three events that affect the number of infected singles are
β’
IβS at rate Itβ=itβN,
β’
I+IβII at rate (r+β/N)(2Itββ)βr+β(it2β/2)N, and
β’
S+IβSI at rate (r+β/N)StβItββr+βitβstβN.
Fixing itβ=iβ(0,yβ) we define probabilities
[TABLE]
where z=1+r+β(yβββi/2) is the sum of the numerators. Let
[TABLE]
be the expected change in the number of single infecteds (at partnership breakup) due to the three events. Finally let
[TABLE]
be the expected change in the number of infecteds per event. In equilibrium Ξ(iββ)=0. Having found iββ and sββ=yβββiββ,
it is routine to find iiββ, siββ, and ssββ; see Section 5 of [7] for more details. Itβs also worth noting that the condition iββ=0 is equivalent to R0β=1.
The analysis of the critical case was done in a second paper
by Foxall [4]. The main result is
Theorem 2**.**
Let Vtβ be the number of infected vertices at time t. If R0β=1 then
β’
there are C,Ξ³>0 so that from any initial configuration, with probability at least 1βeβΞ³m, VmCNββ=0, and
β’
if V0ββ₯Nβ and y0ββ₯yβββ(logN)/Nβ there is c>0 so that VcNββξ =0
with probability at least 1βeβc(logN)2.
The goal of this paper is to obtain a more complete description of the process in the case R0β=1. In particular, for the rest of the paper we assume that R0β=1.
Theorem 2 shows that the extinction time ΟNβ is of order N1/2 if V0ββ₯Nβ. By analogy with critical branching processes one might expect the time to be of order N if V0β=N (same order as the initial values). To explain why N1/2 is the right order of magnitude and to indicate what more precise result we would like to prove, we sketch the proof in the following simpler setting.
Example: Contact process on a complete graph with N vertices. Individuals die at rate 1, and give birth at rate Ξ² to an offspring that is sent to a randomly chosen vertex, so the number of occupied vertices X(t) is a Markov chain on {0,1,β¦N} with transition rates
[TABLE]
The critical value for prolonged survival is Ξ²cβ=1.
Theorem 3**.**
Let xNβ(t)=X(N1/2t)/N1/2, with Ξ²=1. Then xNβ(t)βxtβ, the solution of
[TABLE]
Let Ο0β(xNβ)=inf{t:xNβ(t)=0}. If xNβ(0)ββ, Ο0β(xNβ)βΟ0β(x), the hitting time of 0 for the diffusion process started at β.
Proof.
With Ξ²=1 we find
[TABLE]
and using Jensenβs inequality, E[Xtβ] satisfies the differential inequality yβ²β€βy2/N. Since E[X0β]β€N this gives E[Xtβ]β€N/(1+t), and using Markovβs inequality P(XΟ΅N1/2ββ€Ο΅β2N1/2)β₯1βΟ΅. Letting Let xNβ(t)=X(N1/2t)/N1/2 this means that xNβ(Ο΅)β€Ο΅β2 with probability at least 1βΟ΅. The drift of xtNβ is
[TABLE]
while the diffusivity is
[TABLE]
(these terms are explained in Section 2). The first result then follows from Lemma 5 in the next section. Then, as in the proof of Theorem 6 in Section 4.7, to show Ο0β(xNβ)βΟ0β(x), it is enough to show that for each Ο΅>0 we can find Ξ΄>0, so that if xNβ(t)β€Ξ΄ then xNβ(t+Ο΅)=0 with probability at least 1βΟ΅. This is easy to do once we note that Xtβ is dominated by the critical branching process X~tβ in which each particle splits in two, or dies, each at rate one. We know that P(X~tβ=0β£X~0β=k)=(1β(1+t)β1)kβ₯1βk/t, which is at least 1βΟ΅ if we let t=k/Ο΅. Letting k=Ξ΄N1/2, the result follows with Ξ΄=Ο΅2.
β
In the above example, there are three main steps:
i)
Show Xtβ comes down to CΟ΅βNβ within Ο΅N1/2 time,
2. ii)
Show that xNβ(t)=XN1/2tβ/N1/2 converges to a diffusion,
3. iii)
Show that once xNβ(t) is small, it hits zero in a short time.
The corresponding result for the partner model follows the same three steps, but is more complicated because the process is four dimensional and there are two different time scales.
Some notation. To state our results and to avoid confusion between SI and Sβ I etc we introduce alternative notations that we will use throughout the paper: J=II, K=SI and L=SS. We refer to the stochastic process (S,I,J,K,L) as the infection process. We outline some further notational conventions below.
Asymptotic notation. Let aNβ,bNβ be sequences of real numbers.
β’
aNβ=O(bNβ) if limsupNββββ£aNβ/bNββ£<β.
aNβ=o(bNβ) if limNββββ£aNβ/bNββ£=0.
β’
aNβ=Ο(bNβ) if limNββββ£aNβ/bNββ£=β.
Moreover, for efficiency of notation we will say that a certain property holds for o(f(N))β€tβ€Ο(f(N)) if there exist sequences aNβ,bNβ with aNβ=o(f(N)) and bNβ=Ο(f(N)) such that the property holds for all tβ[aNβ,bNβ].
Rescaling. Throughout the paper, the placement of the time variable, as for example Itβ or I(t), is chosen according to notational convenience and does not change the meaning. On the other hand, we will often want to rescale in either time or space, so we introduce the following notation for these purposes. When we need to distinguish the spatial scale, upper case is reserved for the originally defined variables S,I,J,K,L and Y=S+I, and lower case denotes the following:
stNβ=Stβ/N, ytNβ=Ytβ/N,
itNβ=Itβ/Nβ, jtNβ=Jtβ/Nβ, and ktNβ=Ktβ/Nβ.
Note that I,J,K are rescaled by 1/Nβ, and not by 1/N as in Theorem 1; as demonstrated by Theorem 3 this rescaling is more appropriate when R0β=1. To distinguish time scales we note that two scales will be relevant: the original time scale that we call fast, and the Nβ time scale that we call slow, or long. We will use the superscript N for the fast time scale and the subscript N for the slow time scale. So, for example,
itNβ=Itβ/Nβ and iNβ(t)=I(Nβt)/Nβ.
This distinction appears in discussion as well as computation: for example, saying that iNβ reaches a certain value within O(1) amount of time is the same as saying that iN reaches that value in O(N1/2) time.
For the sake of consistency, and to distinguish from limit processes, we will write SN,IN, etc. for the originally defined variables, on the original time scale. A few more processes will be introduced later, and they will follow the same notation for time scale; some will have upper and lower case versions, again to denote different spatial scales; the precise scaling is specified in each case.
Times. We will use lower-case s or t for time variables, T to denote a fixed (deterministic) time and Ο for stopping times. For an R-valued process X, we let
[TABLE]
and if X is R+β-valued we write Ο0β(X,t) for Ο0ββ(X,t). Οxββ(X) denotes Οxββ(X,0) and similarly in other cases. In one case we will need the following:
[TABLE]
We will also define some labelled and unlabelled times such as Ο,Οβ,Ο1β,Ο2β,β¦ when proving specific results, if they do not fit the above template, or to save on notation if they are written frequently.
We first describe the limit processes, followed by statements of the main results, and then we provide the workflow. Throughout the paper, if we say a statement holds with high probability (whp), then it has probability tending to 1 as Nββ.
Deterministic limits. We show in Section 3 that as Nββ, sample paths of ytNβ and (itNβ,jtNβ,ktNβ) converge in distribution to deterministic limits ytβ and (itβ,jtβ,ktβ).
We find that limtβββytβ=yββ, the solution of r+βyβ2β=(1βyββ)rββ, while (itβ,jtβ,ktβ) converges as tββ to a point on the ray (Ξ±,Ξ²,1)R+β
of fixed points for the linear system described in (17), where Ξ±,Ξ² are given by (21).
This is reminiscent of (multiplicative) state space collapse in queueing networks where a vector
of queue lengths are all proportional to one of them. There are many results of this type.
For examples, see [8, 1, 21, 20, 19].
Diffusion limits. We will show that the fluctuations ztNβ=Nβ(ytNββyββ) are approximately an Ornstein-Uhlenbeck process
[TABLE]
that evolves on the fast time scale, where ΞΌzβ,Οzβ are some positive constants. On the other hand, the fluctuations of (iN,jN,kN) (once they are close to the ray) occur on the slow time scale. Since it stays close to a ray in phase space, (iN,jN,kN) is effectively one-dimensional, and we will show that iNβ(t)=IN(Nβt)/Nβ converges to the limit in (2) but with different constants for the mean and variance. As in the previous result, the hitting time of [math] converges. More precisely, we prove the following results, which are the main goal of this article. As pointed out earlier, R0β=1 is assumed throughout; for clarity, we recall this assumption in each of our main results.
Theorem 4**.**
Suppose that R0β=1, β£(iNβ(0),jNβ(0),kNβ(0))β(Ξ±x,Ξ²x,x)β£=O(NβΟ΅) for some x,Ο΅>0 and β£zNβ(0)β£=O(1) as
Nββ, where Ξ± and Ξ² are defined in (21). Then there are constants ΞΌXβ,ΟX2β>0 such that for any fixed T>0, iNβ converges in distribution in C[0,T] to the diffusion
[TABLE]
started from X0β=Ξ±x.
It is possible to compute the constants ΞΌXβ,ΟXβ from our proof; since the expressions are not particularly nice-looking and do not add much insight, we have omitted them. It is possible the assumptions on the rate of convergence of initial data may be relaxed; to do so one would require a more careful account of transient behavior. Since this paper is already lengthy, we have not pursued this extension.
Our next result builds on Theorem 4 and allows the process to start from β. In the proof of Theorem 5, which is in Section 4, we also point out why it makes sense to start the limiting diffusion (3) from β.
Theorem 5**.**
Suppose that R0β=1, iNβ(0)+jNβ(0)+kNβ(0)ββ and yNβ(0)βyββ as
Nββ. Then iNβ converges in distribution in C[Ο΅,T] for any fixed 0<Ο΅<T<β to the diffusion (3),
started from X0β=β.
It is possible that in Theorem 5 the assumption yNβ(0)βyββ can be dropped. We do not pursue this direction in this paper.
Lastly we show convergence of the hitting time.
we have Ο0β(iNβ+jNβ+kNβ)βΟ0β(X),
the time to hit zero for the limiting diffusion (3).
The separation of time scales between yN and the infection variables iN,jN,kN may remind the reader of the work of Kang and Kurtz [12] and Kang, Kurtz, and Popovic [13] on chemical reaction networks. We found that writing our model in their framework does not simplify the difficult aspects of the proof, so we have opted instead to use a general result of [3] for obtaining the diffusion limit, which is tailored to our context in Lemma 5.
Workflow. There are seven main steps, described in greater detail in Section 4.
In order to make certain estimates it is helpful to define the following additional observables:
i)
The positive linear combination HtNβ=ItNβ+Ξ³JtNβ+Ξ·KtNβ and htNβ=HtNβ/Nβ, where (1,Ξ³,Ξ·), defined by (25), is a left eigenvector for the matrix A given by (16), that determines the linear system (17) for (itβ,jtβ,ktβ). The variable HN is helpful to the analysis because the linear terms drop out of the equation for its drift.
2. ii)
The rescaled infection vector (UN,VN,WN)=(IN,Ξ³JN,Ξ·KN)/HN, and its metastable equilibrium value (uββ,vββ,wββ) which is given by (38).
3. iii)
The quantity QN=ΞΈ2β(UNβuββ)2+ΞΈ1β(VNβvββ)2, where ΞΈ1β,ΞΈ2β, given by (41), are well-chosen positive constants. QN measures the deviation of (UN,VN,WN) from equilibrium, so when QN is small, (itNβ,jtNβ,ktNβ) is close to the invariant ray, a property which is essential to obtaining a limiting 1-dimensional equation for the diffusion.
Of course, HNβ(t)=HN(Nβt), etc. The main steps, written in terms of the slow time scale, are sketched below in the context of Theorem 5, when hNβ(0)=Ο(1); for Theorem 4, we just need that if β£zNβ(0)β£,hNβ(0) and QNβ(0) are small, then they can be kept small for Ο(1) amount of time.
Lemma 6. Show that β£zNβ(t)β£=O(logNβ) for o(1)β€tβ€Ο(1).
2. 2.
Lemma 7. Show that hNβ(t)=O(logN) for o(1)β€tβ€Ο(1).
3. 3.
Lemma 8. Show that β£QNβ(t)β£=O(Nβ1/6) for o(1)β€tβ€Ο(1).
4. 4.
Lemma 10. Show that the integral of iNβ(t)zNβ(t) averages to zero on finite time intervals.
5. 5.
Lemma 11. Show for any Ο΅>0 there is CΟ΅β>0 so that P(ΟCΟ΅βββ(hNβ)β€Ο΅)β₯1βΟ΅.
6. 6.
Lemma 12, Theorems 4 and 5. Show convergence of iNβ(t) to the diffusion limit.
7. 7.
Lemma 13. Show that Ο0β(hNβ)β0 in probability as hNβ(0)β0, uniformly for large N.
The organization of the rest of the paper is as follows: In Section 2 we gather some probability estimates and limit theorems that are used throughout the paper. In Section 3 we describe the deterministic limits. In Section 4 we state precise lemmas relating to each of the workflow steps, and prove diffusion limits. The latter sections are devoted to proofs of the lemmas.
2 Sample path estimation
In this section we describe some sample path estimates, a diffusion limit theorem, and results on drift and diffusivity of functions of continuous time Markov chains that are used throughout the paper. Any results that are not cited are proved in the Appendix. The natural setting for these results is semimartingales. For an overview of the semimartingale theory that is used here, we refer the reader to [9].
First we recall some standard definitions from semimartingale theory, noting along the way how the present context fits into this framework.
Given a stochastic process X we denote by Xββ the left-continuous process obtained from X. We further let ΞX=XβXββ denote the process of jumps. We say that X has bounded jumps if β£ΞXβ£β€c a.s.Β for some constant c>0, and let Ξββ(X) denote the infimum of such values of c. X is quasi-left continuous (qlc) if ΞXΟβ=0 a.s.Β on {Ο<β} for any predictable time Ο.
Given a process A, define the process Var(A) by setting Var(A)tβ(Ο) equal to the total variation of the function sβ¦Asβ(Ο) on the interval [0,t]. A process A has finite variation if Var(A)tβ(Ο)<β for each t,Ο, and is locally integrable if it has a localizing sequence (Οnβ) such that E[Var(A)Οnββ]<β for each n. The compensator of a locally integrable process A, denoted Ap, is the unique predictable and locally integrable process such that AβAp is a local martingale (see [9, I.3.18]).
A semimartingale (s-m) X is a process that can be written as X=X0β+M+A, where X0β is an F0β-measurable random variable, M is a local martingale and A has finite variation. We call a semimartingale special if it can be written as
[TABLE]
where Xp is the compensator of X and Xm is a uniquely defined local martingale satisfying X0mβ=0.
By [9, I.4.24], if X has bounded jumps then it is special and β£ΞXmβ£β€2Ξββ(X), and if it also qlc then using [9, I.2.35] in the proof of [9, I.4.24], we have the more convenient estimate Ξββ(Xm)β€Ξββ(X).
Letting X=(SN,IN,JN,KN,LN) denote the infection process, we note that the estimates of Lemma 1 and the upcoming Lemma 4 will be applied to observables of the form f(XtΟβ), where f:RβR is Lipschitz, RβR5 is compact, and Ο is a stopping time so that the stopped process XtΟβ=Xtβ§Οβ has XtΟββR for tβR+β. Any such process is right continuous and has finite variation so is a s-m, and has bounded jumps since this is the case for X and since f is Lipschitz. Let qiβ(x), i=1,β¦,n denote the rates of the various transitions (S+IβK,KβJ,JβK etc.) and Ξiβ their effect (for example, SN,IN decreases by 1, KN increases by 1), and let Ytβ=f(XtΟβ). By writing Ytβ as a sum of jumps and using the standard linear and quadratic martingales for Poisson processes, it is easy to show that Y is qac (thus also qlc) and has
[TABLE]
a fact that we use ubiquitously when invoking Lemma 1 below.
In a few cases, we are interested in computing the drift for products of such processes, as well as processes of the form f(XtΟβ)g(t), where g(t) is an absolutely continuous deterministic function (which is easily shown to be a qac s-m).
Below we state a result from [6] that allows to find the drift for products of qac s-m.
The next result will allow us to obtain simple estimates for the drift of certain processes. As in [9, I.3.4], if H is optional and A has locally finite variation, we let
Let X be a qac s-m with bounded jumps and let fβC2(R). Then, f(X) is a qac s-m and satisfies the following inequality for Lebesgue-a.e. t:
[TABLE]
Building on Lemma 1 we derive the following simple result, which is the basis of several estimates in this article.
Lemma 4** (Drift barrier).**
Fix x>0 and let X be a qac s-m on R with bounded jumps, such that Ξββ(X)β€x/2. Suppose there are positive reals ΞΌββ,Οβ2β,CΞΌβββ,CΞβ with max{Ξββ(X)ΞΌββ/Οβ2β,1/2}β€CΞβ so that if 0<Xtβ<x then
[TABLE]
Let Ξ=exp(ΞΌββx/(32CΞβΟβ2β)). Then we have
[TABLE]
We will occasionally need to apply Lemma 4 to a stopped process, for which the following easy corollary will be helpful.
Corollary 1** (Drift barrier with stopped process).**
In the setting of Lemma 4, let Ο be a stopping time and suppose that (7) holds assuming t<Ο in addition to 0<Xtβ<x. Then
Let XtNβ be a sequence of qlc semimartingales, a be a Lipschitz dΓd matrix-valued function on Rd and b:RdβRd be Lipschitz. Suppose that a.s. β£ΞXtNββ£β€cNβ with cNββ0 as Nββ. Also assume that for each T,R>0,
[TABLE]
as Nββ, where the convergence holds in probability, and ΟR+β(β£XNβ£)=inf{t:β£XtNββ£β₯R}. Suppose X0NββxβRd. Then XtNβ converges in distribution to the diffusion process x with
[TABLE]
In particular, if a=0 then XN converges to the solution of the ODE system with
[TABLE]
The above statements also hold if XN are qac with drift and diffusivity given by functions ΞΌNβ,ΟN2β satisfying
[TABLE]
3 Deterministic limits
The goal of this section is show that on the fast time scale, yN and (iN,jN,kN) have deterministic limits, and to compute a relevant eigenvector for later on. In particular, none on the theorems of this section are used elsewhere in the paper; they are simply provided for context. It is worth noting that the limit for (iN,jN,kN) is a linear system, and only comes into force once yN is close to its equilibrium value yββ.
Recall that, in terms of original notation, JN=II, KN=SI and LN=SS.
From the transition rates of the partner model we get the following equations for the drift (see [7, Section 5] for a detailed derivation):
[TABLE]
Recalling that YN=SN+IN is the number of unpartnered individuals and considering only the rate of partnership formation and dissolution, we obtain
[TABLE]
Since ytNβ=YtNβ/N,
[TABLE]
Since transition rates are O(N) and yN jumps by Β±2/N we have Ο2(yN)β€CN/N2=C/N=o(1), for some absolute constant C. Using Lemma 5 we obtain the following result.
Theorem 7**.**
If y0Nββy0β as Nββ then ytNββytβ,
the solution to the initial value problem with y0β and
[TABLE]
From the limiting differential equation, we see that in equilibrium
[TABLE]
Since SN+IN+2(JN+KN+LN)=N and SN is accounted for by YN, the three remaining equations are those for IN,JN and KN. Since YN tends towards Nyββ it is helpful to introduce the variable ZN=YNβNyββ to describe its distance from equilibrium. Most of the terms in these equations are linear, with the exception of terms involving StβItβ and Itβ(Itββ1). Writing SN=YNβIN=Nyββ+ZNβIN, from (11) we find that
[TABLE]
where the matrix A is given by
[TABLE]
Since IN,JN,KN jump by O(1) at rate O(IN+JN+KN), the diffusivity matrix has entries of size O(IN+JN+KN).
Results in [4] suggest, and our results will show that for any Ο΅>0, after Ο΅N1/2 time IN, JN, and KN are O(Nβ). Looking at (15), if IN+JN+KN and ZN are o(1) then the entries of the diffusivity matrix, as well as the non-linear terms in the drift, are o(IN+JN+KN). Theorem 7 implies that if Z0Nβ=o(N) then ZsNβ=o(N) uniformly on (fixed) finite time intervals [0,t]. Thus, if we rescale to itNβ=ItNβ/Nβ, jtNβ=JtNβ/Nβ and ktNβ=KtNβ/Nβ (in fact any rescaling by 1/f(N) where f(N)ββ will work but f(N)=Nβ is the most relevant to the main results) and use Lemma 5 we obtain the following result.
Theorem 8**.**
If y0Nββyββ and (i0Nβ,j0Nβ,k0Nβ)β(i0β,j0β,k0β) as Nββ then (itNβ,jtNβ,ktNβ)β(itβ,jtβ,ktβ), the solution to the initial value problem with (i0β,j0β,k0β) and
[TABLE]
Theorem 8 is not used elsewhere in the paper; it only motivates the following calculations.
To analyze the limit behavior of (17), which is a linear system, we write the condition for an equilibrium as A(i,j,k)T=0. To have a nontrivial solution we need det(A)=0.
Expanding around the first row
[TABLE]
For det(A)=0 we need
[TABLE]
In Section 11 we show that (19) is equivalent to R0β=1. This indeed shows that there is a non-trivial equilibrium. We now proceed to find the solution.
To have A(i,j,k)T=0 we must have
[TABLE]
The second equation implies j=Ξ»k/(rββ+2). Using this in the first equation we want
[TABLE]
Solving we see that if
[TABLE]
then the ray (Ξ±z,Ξ²z,z), zβ₯0 is invariant for the dynamical system (17).
To prove the dynamical system converges to this ray we note that
[TABLE]
The eigenvalues of A are the roots of 0=det(ΞΈIβA)=ΞΈ3+b1βΞΈ2+b2βΞΈ+b3β, where
[TABLE]
and b2β is the sum of the 2Γ2 principal minors of βA, which is given by
[TABLE]
Note that the above is positive since each of the two negative terms are cancelled by a part of the positive term that precedes it. Since b3β=det(βA)=0 and b1βb2ββb3β>0 one can use the Routh Hurwicz conditions to conclude that the other two eigenvalues have negative real part. Alternatively one can observe that the non-zero roots of the equation det(ΞΈIβA) are
[TABLE]
Therefore the dynamical system (17) indeed converges to the invariant ray (Ξ±z,Ξ²z,z),zβ₯0.
A quantitative statement that applies to the infection process is given in Lemma 8.
4 Worklow and diffusion limits
In this section we give a precise statement of the lemmas corresponding to the workflow steps outlined at the end of the Introduction, and use these lemmas to prove the main results, Theorems 4,5, and 6. The lemmas are listed in the same numerical order as in the Introduction, which is also the order in which they will be proved in subsequent sections.
4.1 Step 1: the number of singles Ytβ
Recall that (see (11)-(12)) on the original time scale
[TABLE]
If we let ztNβ=Nβ1/2(YtNββNyββ), that is, YtNβ=Nyββ+N1/2ztNβ then
[TABLE]
Since rββ(1βyββ)=r+βyβ2β,
[TABLE]
and
[TABLE]
So, if zN=o(N1/4), then using Lemma 5, ztNββztβ which satisfies
[TABLE]
i.e., the limit ztβ is an Ornstein-Uhlenbeck process. To control the behavior of ztNβ we will prove the following two facts.
Lemma 6** (Step 1).**
There is a constant C\refmaxzβ so that with high probability,
β’
β£ZtNββ£β€C\refmaxzβ* for some tβ€C\refmaxzβlogN and*
β’
if β£z0Nββ£β€(C\refmaxzβ/2)logNβ then β£ztNββ£β€C\refmaxzβlogNβ for all tβ€N.
To understand the logNβ scaling note that the stationary distribution of the Ornstein-Uhlenbeck process is a normal,
whose tail scales roughly like exp(βx2/2Ο2)/x; using the heuristic that the time to reach a rare set scales like the reciprocal of its stationary probability and letting x be a constant times logNβ, we find the time to reach level x scales roughly like Np for constant p, which (with p=1) is the time scale on which we control ztNβ.
4.2 Step 2: a special linear combination of (IN,JN,KN)
In Section 3 we showed that (iN,jN,kN) converges quickly (in O(1) time) to the invariant ray (21) for the ODE (17).
Thus the knowledge of one component determines the other two, provided we have good control on the distance of the triple from the invariant ray.
Recall that in the example from the Introduction (contact process on a complete graph at criticality), the negative drift of Xtβ brings it down to the natural spatial scale for the diffusion, CΟ΅βN1/2, within Ο΅N1/2 time.
This suggests that in our model, we should look for a linear combination of (IN,JN,KN) that has negative drift when it takes values that are Ο(N1/2).
Motivated by these observations we introduce the variable HN=IN+Ξ³JN+Ξ·KN where
(1,Ξ³,Ξ·)A=0 and A is given by (16). Existence is guaranteed since det(A)=0, and the desired constants satisfy
[TABLE]
Solving for Ξ· in the first equation, and Ξ³ in the second, we find that
[TABLE]
Clearly, Ξ·>1, which implies Ξ³>1. By assumption, R0β=1, so in the notation of [7] we have Ξ»=Ξ»cβ. Since Ξ» is finite it follows from [7, Theorem 2.1] that r+βyββ>1 and so Ξ·<2, which easily implies Ξ³<2. We record these in a display equation for later use:
[TABLE]
We now compute the drift of HN, using (15). From our choice of linear combination, the linear part drop out, and only the fluctuation term with ZN, the quadratic part, and the lower order term remain:
[TABLE]
This gets a bit nicer if we rescale in space and time. With hNβ(t)=HN(Nβt)/Nβ we have
[TABLE]
From (27) we have Ξ³/2<1<Ξ· so the coefficient in the second term is negative. If iNβ=Ο(1) the second term dominates the third. Using the bound β£zNβ£=O(logNβ), the second term dominates the first term when iNβ=Ο(logNβ). Thus, to obtain a closed-form differential inequality for E[hNβ] which is useful when hNβ=Ο(logNβ) it would be enough to show that IN/HN is bounded away from zero after a short time, which is done in Section 6. Writing ΟN1/5ββ(HNβ)=inf{t:HNβ(t)β€N1/5} we will prove the following result. Note we are using the slow time scale here.
Lemma 7** (Step 2).**
Let Ο=ΟN1/5ββ(HNβ)β§ΟC\refmaxzβlogNβ+β(β£zNββ£). With high probability,
β’
hNβ(t)β€21βlogN* for some tβ€1/logNβ and*
β’
if hNβ(0)β€21βlogN then hNβ(t)β€logN for all tβ€N1/2β§Ο.
The choice of N1/5 as a floor on HNβ is so that once HNββ€N1/5 a branching process approximation can be used to take HNβ to [math]. See Section 10.
Our reliance on Lemma 6 to bound the first part of the drift prevents us from showing hNβ comes all the way down to O(1).
To obtain the stronger bound we will have to show that the first term in the drift in (29) averages out to 0.
4.3 Step 3: (IN,JN,KN) stays close to the invariant ray
To reduce (IN,JN,KN) to a one-dimensional system we let UN=IN/HN, VN=Ξ³JN/HN, and WN=Ξ·KN/HN.
The coefficients in VN and WN are there to make UN+VN+WN=1.
Recalling the definitions of Ξ±,Ξ²,Ξ³, and Ξ· (see (21) and (25)) we let uββ=Ξ±/d, vββ=Ξ²Ξ³/d, and wββ=Ξ·/d where d=Ξ±+Ξ²Ξ³+Ξ·
which, as the reader will see, is the fixed point for the dynamical system corresponding to (UN,VN,WN). Let QN=ΞΈ2β(UNβuββ)2+ΞΈ1β(VNβvββ)2. This result is stated on the fast time scale, since this is the time scale on which QN naturally converges.
Lemma 8** (Step 3).**
Let Ο=ΟN1/5ββ(HN)β§ΟC\refmaxzβlogNβ+β(β£zNβ£)β§ΟlogN+β(hN). There is a constant C\refrayβ so that, for any sequence of constants cNQβ with Nβ1/6β€cNQβ=o(1), with high probability,
β’
ΟNβ1/6/2ββ(QN)β§Οβ€C\refrayβlogN, and
β’
if Q0Nββ€cNQβ/2 then QtNββ€cNQβ for all tβ€Nβ§Ο.
Steps 1,2 and 3 could be called the βa prioriβ bounds, since they provide the control needed to implement the averaging result. With this in mind, we make the following definition. Additional constants for both h and Q are specified since weβll need them later.
Definition 2**.**
Let cNQβ,cNhβ be sequences of constants. Say that there is cNhβ,cNQβ control at time t, on the slow time scale, if
[TABLE]
Define the cNhβ,cNQβ-control time on the slow time scale as
[TABLE]
Define the control time ΟNβ(ctrl,t) as ΟNβ(ctrl,t)=ΟNβ(logN,Nβ1/6,t). Define ΟN(cNhβ,cNQβ,t) on the fast time scale by NβΟNβ(cNhβ,cNQβ,t), similarly for ΟN(ctrl,t).
Applying Steps 1-3 (i.e., Lemmas 6, 7 and 8) sequentially in time, we obtain the following result, which is stated on the slow time scale.
Lemma 9**.**
For each Ο΅>0, with high probability
[TABLE]
In words, this result says that for any fixed Ο΅>0, so long as HNβ has not hit the interval [0,N1/5], then w.h.p.βthe variables β£zNββ£,QNβ and hNβ have the desired upper bounds (i.e., those specified by Definition 2) on the slow time scale, on the time interval [Ο΅,N1/2].
4.4 Step 4: averaging the drift to 0
Recall from Section 4.1 that zN is approximately an O.U. process that oscillates on the fast time scale, and once (iN,jN,kN) converges on the invariant ray, we expect it to diffuse along that ray on the slow time scale and thus move slowly when viewed on the fast time scale. Thus, it should not be surprising that we have the following result.
Lemma 10** (Step 4).**
Fix T<β. Let L:R3βR be Lipschitz in the β1 norm with constant cLβ and such that L(0,0,0)=0. Let Ο(Nβ1/2)=cNhββ€logN and 0<cNQβ=o(1) be sequences of constants and let ΟNβ=ΟNβ(cNhβ,cNQβ,0). With high probability,
[TABLE]
4.5 Step 5: Show hNβ comes down to O(1)
In order to prove Theorem 5 we need to show that w.h.p., hNβ(t)=O(1) for fixed t>0.
Lemma 11** (Step 5).**
Let ΟCββ(hNβ)=inf{t:hNβ(t)β€C}. For small enough Ο΅>0,
[TABLE]
4.6 Step 6: convergence to diffusion
Here we prove Theorem 4 and Theorem 5. We will need the following result, proved in Section 10, that shows that once HNβ hits [0,N1/5], before long the infection process hits [math].
Lemma 12**.**
Suppose that H0Nββ€N1/5, and that w.h.p. suptβ€N1/4ββ£ztNββ£β€C\refmaxzβlogNβ. Then, w.h.p., Ο0β(HN)β€N1/4 and HtNββ€N.24 for all tβ€Ο0β(HN).
We use Lemma 5 to prove this theorem.
Since the jump size of iNβ is O(Nβ1/2)=o(1) it suffices to find a,b and show convergence of the compensator and predictable quadratic variation. By assumption,
a)
β£zNβ(0)β£=O(1) so by Lemma 6, for fixed T>0, w.h.p.ββ£zNβ(t)β£β€C\refmaxzβlogNβ for all tβ€T, and
2. b)
QNβ(0)=O(NβΟ΅), so letting cNQβ=2QNβ(0)β¨Nβ1/6, Lemma 8 shows that for fixed T>0, w.h.p.βQNβ(t)β€cNQβ for all tβ€Tβ§ΟN1/5ββ(HNβ).
Point b) implies that hNβ(t)=(1/uββ+O(QNβ(t)1/2))iNβ(t)=(1/uββ+o(1))iNβ(t) for all tβ€Tβ§ΟN1/5ββ(HNβ).
Point a) and Lemma 12 imply that w.h.p.Β for all ΟN1/5ββ(HNβ)β€tβ€T, iNβ(t)β€hNβ(t)=O(N0.24β1/2)=o(1).
Thus if Theorem 4 can be proved for hNβ for some constants ΞΌββ,Οβ2β then it holds for iNβ with different constants. We recall (29):
[TABLE]
Also iNβ(0),jNβ(0),kNβ(0)=O(1) so the same holds for hNβ(0). Letting cNhβ=logN, by Lemma 7 and a) above, w.h.p.βhNβ(t)β€cNhβ for all tβ€Tβ§ΟN1/5ββ(HNβ). Combining a) and b) with the bound on hNβ, w.h.p.
[TABLE]
Using this and Lemma 10, for any fixed T>0, w.h.p.
[TABLE]
uniformly for tβ€T. Since iNββ€hNβ, w.h.p.Β for tβ€Tβ§ΟN1/5ββ(HNβ) the third term in the RHS of (30) is O(Nβ1/2logN)=o(1).
Using the bound on QNβ, if hNβ(t)β€R for fixed R>0 and tβ€Tβ§ΟN1/5ββ(HNβ) then w.h.p.
and let ΟR+β(hNβ)=inf{t:hNβ(t)β₯R}. Recall that hNpβ denotes the compensator of hNβ (see Section 2). Since hNpβ(t)=β«0tβΞΌsβ(hNβ)ds, we find that w.h.p.
[TABLE]
Next let us consider the easier case ΟN1/5ββ(HNβ)β€tβ€Tβ§ΟR+β(HNβ). For this range of values of t, from (30), and using Lemma 6 it easily follows that ΞΌ(hNβ)=o(1) and hNβ=o(1). So w.h.p.
[TABLE]
This proves the assertion about the compensator of hNβ, as required by Lemma 5.
Now to calculate the diffusivity of h we let m index the possible transitions and write
[TABLE]
where qmβ is the rate of transition m (it is a function of the state) and ΞmβhNβ is the change in hNβ at that transition.
Note that there are constants cmβ so that (ΞmβhNβ)2=cmβ/N.
Recall that on the fast (original) time scale the transitions of IN,JN,KN have the following rates:
[TABLE]
Most rates are linear in IN,JN, or KN. Those which are not are the I+IβJ transition and the I+SβK transition. As we have seen above, w.h.p., for all tβ€Tβ§ΟN1/5ββ(HN), INβ(t)β€N1/2logN. Therefore the I+IβJ transition has rate O((logN)2). By a similar reasoning the I+SβK transition has rate r+β(yββ+O(Nβ1/2logN))IN=r+βyββIN+O((logN)2).
Speeding up time by N1/2 and writing in lower case, the rates are equal to NiNβ, 2NjNβ, etc and the error terms have rate O(Nβ(logN)2). Since each of iNβ(t),jNβ(t),kNβ(t) is equal to (constant+o(1))hNβ(t) for tβ€Tβ§ΟN1/5ββ(HNβ), if in addition hNβ(t)β€R then there are constants dmβ so that for each m,
[TABLE]
Thus there is a constant Οβ2β so that if hNββ€R and tβ€Tβ§ΟN1/5ββ(HNβ)β§ΟR+β(hNβ) then w.h.p.
[TABLE]
If ΟN1/5ββ(HNβ)β€tβ€T then since w.h.p.Β hNβ(t)=O(N.24β1/2)=o(1), an easy computation gives Ο2(hNβ)=o(1).
This implies the desired convergence of predictable quadratic variation with a(x)=Οβ2βx. An application of Lemma 5 now shows hNβ (and hence iNβ) converges to a diffusion of the desired form.
β
We first explain why it makes sense to start the limiting diffusion X from β. For C>0, let ΟCββ(X)=inf{t:Xtββ€C}. Using Jensenβs inequality,
[TABLE]
so we find that
[TABLE]
and using Markovβs inequality,
[TABLE]
In particular, if x,Cββ with Cβ€x then ΟCββ(X) converges in probability to zero. It is then not hard to show that the law of X, conditioned on X0β=x, converges in distribution as xββ.
Since the limiting diffusion is continuous, it crosses any level C>0, if it starts from β. Thus if we let ΟCβ(X)=inf{t:Xtβ=C}, ΟCβ(X)β0 in probability as Cββ.
Since convergence in distribution allows for small time change, given the proof of Theorem 4, it is enough to show there are sequences Ο΅mββ0,Cmβββ so that for each m, w.h.p.Β there is a tmββ€Ο΅mβ such that
β’
hNβ(tmβ)=Cmβ+O(Nβ1/2),
β’
β£zNβ(tmβ)β£β€C\refmaxzβlogNβ and
β’
β£QNβ(tmβ)β£β€Nβ1/6.
Letting Cmβ=m and Ο΅mβ=1/Ο΅m for small Ο΅>0, Lemma 11 gives the bound on hNβ. Since Lemma 11 also gives tmββ₯Ο΅/m3, we may apply Lemma 9 to obtain the desired bounds on β£zNββ£ and QNβ. This completes the proof.
β
4.7 Step 7: extinction time
To prove a result for the time for the infection to die out, note that Ο0β(hNβ)=inf{t:hNβ(t)=0} is the first time (on the N1/2 time scale) there are no infected individuals.
The continuous mapping theorem makes half of the
proof easy. To complete it we need to show that Ο0β(hNβ) converges in probability to [math] as hNβ(0)β0, uniformly for large N. This is accomplished by combining Lemma 12 with the following result, that by the definition of Ο(ctrl,0) implies that if hNβ is initially small and if the values of β£zNββ£,QNβ can be kept under control then within a short time, HNβ hits [0,N1/5].
Lemma 13**.**
Fix Ο΅>0. There is Ξ΄>0 so that
[TABLE]
Lemmas 12 and 13 are postponed to Section 10. For now we use them to prove Theorem 6.
Recall that Q is the law of the limiting diffusion for hNβ and Οxβ(X) is the hitting time of x>0 for the limiting diffusion. By the strong Markov property and Blumenthalβs 0-1 law, after hitting x, the process
will with probability one immediately hit (0,x) and (x,β).
From this it follows easily that Οxβ(X):CβR is continuous Q-almost surely.
Suppose the infection process satisfies the conditions of Theorem 4 with hNβ(0)βx.
Let PNβ denote its law and let Οxββ(hNβ)=inf{t:hNβ(t)β€x}. Using the continuous mapping theorem,
[TABLE]
Let Ο΅>0. If x is small enough then Qxβ(Ο0β(X)>Ο΅)<Ο΅ and hence Q(Ο0β(X)>t+Ο΅)β€Q(Οxβ(X)>t)+Ο΅. Combining this with the last result
and noting that xβ¦Οxββ(hNβ) is increasing,
[TABLE]
Letting Ο΅β0 we have half of the desired convergence in distribution.
To get the other half we again fix any arbitrary Ο΅>0. Note that for Ξ΄>0
[TABLE]
Letting Nββ, PNβ(ΟΞ΄ββ(hNβ)>t)βQ(ΟΞ΄β(X)>t)β€Q(Ο0β(X)>t). So it suffices to show that for each Ο΅>0 there is a Ξ΄>0 so that the second term is at most O(Ο΅), uniformly for large N. Since by convergence in distribution, on the N1/2 time scale it takes at least s>0 amount of time, w.h.p.βas sβ0+ and Nββ, for h to reach Ξ΄ if hNβ(0)βx>Ξ΄, using Lemma 9 we may assume when taking the above sup that not only hβ€Ξ΄ but also that β£zNβ(t)β£ and QNβ(t) are small (in the sense of the definition of Ο(ctrl,t) given in Definition 2) for all tβ€Ο(1)β§ΟN1/5ββ(HNβ). The desired bound then follows directly from Lemmas 12 and 13. This completes the proof.
β
5 Step 1: upper bound on β£zNβ£
Let C\refmaxzβ be a sufficiently large constant. In this short section we prove Lemma 6, in two parts:
β’
approach: show that β£ZtNββ£β€C\refmaxzβ for some tβ€C\refmaxzβlogN w.h.p., then
β’
control: show that if β£ztNββ£β€(C\refmaxzβ/2)logNβ then w.h.p., β£ztNββ£β€C\refmaxzβlogNβ for all tβ€N.
where, for each N, FNβ:RβR is just some function. Let YβNββ(0,N) be the unique value with FNβ(YβNβ)=0.
Note that YβNβξ =Nyββ since we used YN(YNβ1) and not (YN)2 to compute it. However note that FNβ(Nyββ)=r+βyββ and by concavity of FNβ, β£FNβ²ββ£ is bounded below by β£FNβ²β(0)β£=rβββr+β/N, so
[TABLE]
and letting Z~N=YNβYβNβ we have Z~NβZN=YβNββNyββ=O(1), so it is enough to prove the result with Z~N in place of ZN. Since FNβ is concave, if we let rNβ=FNβ(0)/YβNβ then for YNβ[0,N] with YNξ =YβNβ we have
[TABLE]
Letting r=21βliminfNβββrNβ, it follows that FNβ(YβNβ+Z~N)/Z~Nβ€βr for large N and Z~Nξ =0.
If Z~0Nββ₯1 then letting Ο2ββ(Z~N)=inf{t:Z~tNββ€2} and using the product rule (Lemma 2), for t<Ο2ββ(Z~N)
[TABLE]
so ΞΎtβ=exp(r(tβ§Ο2ββ(Z~N)))Z~tβ§Ο2β(Z~N)Nβ is a supermartingale.
If Ο2ββ(Z~N)>t then ΞΎtββ₯2ert. Moreover ΞΎ0β=Z~0Nββ€N. So
[TABLE]
If Z~0Nββ€β1 then letting Ο2ββ(βZ~N)=inf{t:Z~tNββ₯β2}, we obtain the same estimate for P(Ο2ββ(βZ~N)>t), so for Ο2ββ(β£Z~Nβ£)=inf{t:β£ZtNββ£β€2}, taking a union bound and t=ClogN with C=2/r we find
Let x=(C\refmaxzβ/2)logNβ with C\refmaxzβ to be determined and let X=βx+β£zNβxβ£, then Ξββ(X)β€2/N1/2β€x/2 for large N. Since zN jumps by at most x, if β£zNβ£β₯x then ΞΌ(X)=sgn(zN)ΞΌ(zN). From the proof of approach, ΞΌ(zN)/zNβ€βr if zNξ =0. If Xβ₯x/2 then β£zNβ£β₯3x/2 so letting ΞΌββ=3rx/2, ΞΌ(X)β€βΞΌββ. If Xβ€x then β£zNβ£β€2x so using (23)-(24), β£ΞΌ(zN)β£β€Cx and Ο2(zN)β€C for some C>0, so let CΞΌβββ be a large enough multiple of x and Οβ2β a large enough constant. Then, Ξββ(X)ΞΌββ/Οβ2β=o(1) which allows us to take CΞβ=1. Then, Ξβ₯exp(Ξ΄L2) and βΞβx/16CΞΌββββ₯δΠfor some Ξ΄>0. Taking C\refmaxzβ>1/Ξ΄β makes Ξ,Ξ΄Ξβ₯N for large N and the result follows from Lemma 4.
6 Step 2: upper bound on hNβ
Recall HN=IN+Ξ³JN+Ξ·KN and ΟN1/5ββ(HN) is the first time that HNβ€N1/5.
Recalling (28) we see that the negative term in ΞΌ(HN) involves IN. Therefore, the first step is to get a lower bound on IN/HN. Note the event below is taken to be vacuous if ΟN1/5ββ(HN)<C\refbdHIβ.
Lemma 14**.**
There is a constant C\refbdHIβ>0 so that with high probability,
[TABLE]
Proof.
Let Ο΅>0 be a small enough constant, then there are two steps:
β’
approach: show that ΟΟ΅+β(IN/HN)β§ΟN1/5ββ(HN)β€1/Ο΅ w.h.p., then
β’
control: show that if I0Nβ/H0Nββ₯Ο΅ then w.h.p.βItNβ/HtNββ₯Ο΅/2 for all tβ€Nβ§ΟN1/5ββ(HN).
Using the product rule of Lemma 2 and the Taylor approximation of Lemma 3, we find that if HN>N1/5, then since HN=Ο(1),
[TABLE]
The assumption HN=Ο(1) is used together with the fact Ξββ(HN)=O(1) to obtain O(IN/(HN)3) from the Taylor approximation. Next we show the last two terms are O(1/HN). To compute Ο(IN,1/HN) note that IN or HN jumps at rate O(HN), IN jumps by O(1), and 1/HN jumps by O(1/(HN)2) when HN=Ο(1). Multiplying, we obtain Ο(I,1/HN)=O(1/HN). By a similar argument Ο2(HN)=O(HN), and since INβ€HN it follows that Ο2(HN)IN/(HN)3=O(1/HN).
If IN/HNβ€Ο΅ then
[TABLE]
Since β£ZNβ£,INβ€N it follows that ΞΌ(HN)=O(IN).
From (31) and (32) we then deduce that if IN/HNβ€Ο΅ and HN=Ο(1) then
[TABLE]
If Ο΅>0 is taken small enough, the right-hand side is at least a constant ΞΌ0β>0. To estimate Ο2(IN/HN) we note that if HN=Ο(1) then IN/HN jumps at rate O(HN), by an amount O(1/HN) when IN jumps, and an amount O(IN/(HN)2)=O(1/HN) (since INβ€HN) when HN jumps. Thus Ο2(IN/HN)=O(1/HN) when HN=Ο(1).
To summarize our progress so far, if we let
[TABLE]
and note that t<Ο1β implies HN>N1/5=Ο(1) and 1/HN<Nβ1/5, then there are constants ΞΌ0β,C>0 such that
[TABLE]
Define ΞΎtβ=Itβ§Ο1βNβ/Htβ§Ο1βNβ. In the notation of Section 2,
[TABLE]
So for a,Ο>0
[TABLE]
Using Lemma 1, if ΟΞββ(ΞΎ)β€1/2, then the left-hand side of (35) is β₯0 for all tβ₯0 with probability β₯1β2eβΟa, or in other words,
[TABLE]
Letting a=Ο΅ and Ο=(ΞΌ0β/2C)N1/5 gives eβΟa=o(1). Since ΞΎ is stopped if ever HNβ€N1/5, it follows that Ξββ(ΞΎ), which is O(1/HN), is a fortiori O(Nβ1/5), which means that ΟΞββ(ΞΎ)β€1/2 if C>0 is taken large enough. Summarizing, we find that
[TABLE]
Since t>Ο1β if ever ΞΎtββ₯Ο΅, it follows that
[TABLE]
Since 4Ο΅/ΞΌ0β is a constant and Ο1β=ΟN1/5ββ(HN)β§ΟΟ΅+β(IN/HN), the first part is proved.
Control. We now show that if I0Nβ/H0Nββ₯Ο΅ then w.h.p.βItNβ/HtNββ₯Ο΅/2 for all tβ€Nβ§ΟN1/5ββ(HN). To do so we use Corollary 1 to Lemma 4. Let Ο=ΟN1/5ββ(HN), let Xtβ=Ο΅βIN(tβ§Ο)/HN(tβ§Ο),
and let x=Ο΅/2. Similarly as for ΞΎ, we find that Ξββ(X)=O(1/HN)=O(Nβ1/5), which is o(x). From (31)-(32) it is easy to check that β£ΞΌ(IN/HN)β£=O(1) when HN=Ο(1) so let CΞΌβββ be a large constant. From (34) we have ΞΌtβ(X)β€βΞΌ0β and Οt2β(X)β€CNβ1/5 when t<Ο and Xtββ₯0, so let ΞΌββ=ΞΌ0β and Οβ2β=CNβ1/5 for some C>0. In this way Ξββ(X)ΞΌββ/Οβ2β=O(1) which allows us to let CΞβ be a large constant. Then, Ξβ₯exp(Ξ΄N1/5) and βΞβx/16CΞΌββββ₯Ξ΄Ξβ₯N for some Ξ΄>0 and large N, so Corollary 1 gives
w.h.p., hNβ(t)β€21βlogN for some tβ€1/logNβ.
Note the slow time scale is used. We will need the estimates weβve proved so far. Let
[TABLE]
By Lemma 6, Ο1β>N1/2 w.h.p., and by Lemma 14, Ο2β>N1/2β§ΟN1/5βββ(HNβ) w.h.p. It is more convenient if we shift the time variable over by βC\refmaxzβNβ1/2logN so that both estimates begin to hold at t=0; since Nβ1/2logN=o(1/logNβ) this will not affect the conclusion.
From (27), Ξ·>1>Ξ³/2, moreover iNββ€hNβ, so for t<Ο1ββ§Ο2β,
[TABLE]
If hNβ>21βlogN the first term is o((hNβ)2). Since Ξ·>Ξ³/2, we see there is Ξ΄>0 so that, if we let Ο3β=Ο1ββ§Ο2ββ§Ο21βlogNββ(hNβ), then for t<Ο3β,
[TABLE]
Next weβd like to set up a differential inequality for hNβ; the only trouble is, the drift estimate only holds up to a stopping time. To fix this, let Ο(t;h) denote the solution flow for the differential equation hβ²(t)=βΞ΄h(t)2 (i.e., the function with maximal domain containing {0}ΓR such that βtβΟ(t;h)=βΞ΄Ο(t;h)2 and Ο(0;h)=h) and define the continued process
[TABLE]
In words, h~Nβ is equal to hNβ up to time Ο3β, at which point it evolves according to the flow Ο. It is then clear that for all tβ₯0,
[TABLE]
Taking expectations and using Jensenβs inequality we then find
[TABLE]
which implies E[h~Nβ(t)]β€Ο(t;E[hNβ(0)]) (note h~Nβ(0)=hNβ(0)). Solving the DE we have
[TABLE]
If Ο3β>t then h~Nβ(t)=hNβ(t)>21βlogN, so it follows that
[TABLE]
Taking t=1/logNβ the above is o(1). As noted above, Ο1ββ§Ο2β>N1/2β§ΟN1/5ββ(HNβ) w.h.p. Since hNβ>21βlogN implies HNβ>N1/5, if hNβ(s)>21βlogN for all sβ€t then w.h.p.β Ο3β>t. It follows that
[TABLE]
and the statement is proved.
Control. We now show that
if hNβ(0)β€21βlogN then w.h.p.βhNβ(t)β€logN for all tβ€N1/2β§ΟN1/5ββ(HNβ)β§ΟC\refmaxzβ+β(β£zNβ£).
This time, let Ο1β=ΟC\refmaxzβ+β(β£zNββ£), and define Ο2β as in the proof of approach. By Lemma 14,
Ο2β>N1/2β§ΟN1/5βββ(HNβ). For the present result we cannot ignore small times, so first we show the conclusion holds for all tβ€C\refbdHIβNβ1/2 without assuming a bound on iNβ/hNβ. Let Ο3β=Ο1ββ§ΟlogN+β(hNβ). From (29), if t<Ο3β then since iNββ€hNβ, Ξ·βΞ³/2>0 and zNβ(t)=O(logNβ), for large N we have ΞΌ(hNβ(t))β€log(N)hNβ(t). Since hNβ jumps by O(Nβ1/2) at rate NhNβ on the slow time scale, Ο2(hNβ)β€ChNβ for some constant C>0. Let ΞΎtβ=hNβ(tβ§Ο3β), then for a,Ο>0 and all tβ₯0,
[TABLE]
Using Lemma 1, if ΟΞββ(ΞΎ)β€1/2, the LHS is β€0 for all tβ₯0 with probability at least 1β2eβΟa. Letting Ο=(logN)/C and a=1, ΟΞββ(ΞΎ)=O(Nβ1/2logN)β€1/2 for large enough N and eβΟa=o(1), so
[TABLE]
It follows that P(ΞΎtββ€logNΒ forΒ allΒ tβ€C\refbdHIβNβ1/2)=1βo(1), since ΞΎ0ββ€21βlogN and 1+2t(logN)2β€41βlogN for all tβ€C\refbdHIβNβ1/2, which implies that
and the result follows since N1/2β§Ο=N1/2β§ΟN1/5ββ(HNβ)β§Ο1β w.h.p.
β
7 Step 3: (IN,JN,KN) stays close to the invariant ray
In this section we prove Lemma 8. As in the statement of the lemma, let
[TABLE]
Looking back to (32), we showed that if HN=Ο(1) then
[TABLE]
it is clear the same estimate holds with JN,KN in place of IN. If, moreover, HN,β£ZNβ£β€N1/2logN, then since Ξ·,Ξ³β₯1 (see (27)), IN,JN,KNβ€HN, from (32) we obtain the estimate ΞΌ(HNβ)=O((logN)2). Recalling that (UN,VN,WN)=(IN,Ξ³JN,Ξ·KN)/HN, writing (32) but with Ξ³JN and Ξ·KN as well, and using the above estimates, we find that if t<Ο then
[TABLE]
Let JN denote the vector (IN,JN,KN). Again, if HN,β£ZNβ£β€N1/2logN then from (15) we find that ΞΌ(JN)=AJN+O((logN)2Nβ1/5). Letting D=Diag(1,Ξ³,Ξ·) denote the diagonal matrix with 1,Ξ³,Ξ· along the main diagonal, and VN denote the vector (UN,VN,WN)β€, so that VN=DJN/HN. Moreover let Ξ=DADβ1 denote the conjugation of A by D. Combining the estimate on ΞΌ(JN) with (36) we find that if t<Ο then
[TABLE]
To reduce the dimensionality, since from (20) we have A(Ξ±,Ξ²,1)β€R=0 it follows that Ξ(Ξ±,Ξ²Ξ³,Ξ·)β€R=0. We select the vector Vββ=(uββ,vββ,wββ) with uββ+vββ+wββ=1, namely
[TABLE]
Then, WNβwββ=β(UNβuββ)β(VNβvββ), so (37) can be re-written as
[TABLE]
Note that Ξ is obtained from A by multiplying entries in rows 2,3 by Ξ³,Ξ· and dividing entries in columns 2,3 by Ξ³,Ξ·, respectively. Referring to (16) we find that
[TABLE]
The diagonal entries in the matrix are negative, so the trace is negative. From (27), Ξ³/2<Ξ· which implies 2rββ/Ξ³βrββ/Ξ·>0, so the determinant is positive and so both eigenvalues have negative real part (which we already knew from analyzing A). To turn these calculations into control on the distance of V from Vββ we let
[TABLE]
and examine QtNβ=ΞΈ2β(UtNββuββ)2+ΞΈ1β(VtNββvββ)2.
Approach. First we show that w.h.p., Ο(Nβ1/6/2)ββ(QN)β§Οβ€C\refrayβlogN. From Lemma 2, for a process X we have ΞΌ(X2)=2XΞΌ(X)+Ο2(X), and of course, Ο2(Xβc)=Ο2(X) and ΞΌ(Xβc)=ΞΌ(X) for any constant c. As noted in the proof of Lemma 14, UN=IN/HN jumps by O(1/HN) at rate O(HN), so Ο2(UN)=O(1/HN) and similarly for VN. Let a1β=min(r+βyββ+1+rββ/Ξ·,rββ+2+Ξ³Ξ»/Ξ·), so that both diagonal entries in (40) are at most βa1β. Since the cross-terms cancel (by choice of ΞΈ1β,ΞΈ2β), from (39) we find that for t<Ο,
[TABLE]
for some constant a2β and large N. It is also not hard to check that β£ΞΌtβ(QtNβ)β£=O(QtNβ) for t<Ο, which we will need in a moment. Letting Q~β=Qβ(a2β/a1β)(logN)2Nβ1/5, ΞΌtβ(Q~βN)β€β2a1βQ~βN for t<Ο so ΞΎtβ=exp(2a1β(tβ§Ο))Q~βN(tβ§Ο) is a supermartingale. Since (a2β/a1β)(logN)2Nβ1/5β€Nβ1/6/4 for large N and since ΞΎ0β=Q~β0Nββ€Q0Nββ€ΞΈ1β+ΞΈ2β,
[TABLE]
Choosing t equal to a large enough multiple of logN, the RHS is o(1).
Control. Now we suppose that cNQβ are constants with Nβ1/6β€cNQβ=o(1) and show that
if Q0Nββ€cNQβ/2 then w.h.p.βQtNββ€cNQβ for all tβ€Nβ§Ο.
Ο1β=Οβ§ΟcNQβ+β(QN), Β x=cNQβ/2 Β and Β Xtβ=Qtβ§Ο1βNββx.
As noted above, UN jumps by O(1/HN) when HN=Ο(1). Thus when HN=Ο(1), (UNβuββ)2 jumps by O((UNβuββ)/HN+1/(HN)2). If t<Ο and QNβ€cNQβ then since HNβ₯N1/5 and cNQββ₯Nβ1/6=Ο(1/HN),
In this section we prove Lemma 10.
Letting Οz2β=4rββ(1βyββ), using (22) and recalling rββ(1βyββ)=r+βyβ2β, we see
[TABLE]
In order to prove an averaging result weβd like to work with a process whose transitions are symmetric on reflection about 0. Thus we define the following process z~N, which can be thought of as a spatially discrete Ornstein-Uhlenbeck process. Letting ΞΌzβ=rββ+2r+βyββ we let z~N have transitions
[TABLE]
Furthermore take z~N(0)=2Nβ1/2βN1/2zN(0)/2β so that z~N takes values in 2Nβ1/2Z. Couple zN with z~N in the obvious way, i.e.Β couple jumps of +2/N1/2 at the minimum of the two rates and similarly for jumps of β2/Nβ1/2, and let DN=zNβz~N with respect to this coupling. The following result controls the size of DN. The power of logN in the bound is not optimal but itβs good enough and frees us from having to track yet another constant.
Lemma 15**.**
With high probability,
[TABLE]
Proof.
DN has the following transitions:
[TABLE]
Using the fact that max(a,0)βmax(βa,0)=a for aβR, we compute
[TABLE]
From their definition and the choice of constant ΞΌzβ=rββ+2r+βyββ,
[TABLE]
and so
[TABLE]
Computing the diffusivity,
[TABLE]
Define Ο=ΟC\refmaxzβlogNβ+β(β£zNβ£)β§ΟNβ1/4logN+β(β£DNβ£), and observe that if t<Ο then not only is β£ztNββ£β€C\refmaxzβlogNβ but also
In the context of Lemma 10, if t<ΟNβ=ΟNβ(cNhβ,cNQβ,0) then hNβ(t)β€cNhββ€logN. Letting LNβ(t) denote L(iNβ(t),jNβ(t),kNβ(t)), since L(0,0,0)=0, iNβ,jNβ,kNββ€hNβ and L is Lipschitz with constant cLβ, β£LNβ(t)β£β€cLβcNhββ€cLβ(cNhβ)1/2(logN)1/2). Let ΟN,Dβ=ΟNββ§ΟNβ1/4logN+β(β£DNβ(s)β£), then
[TABLE]
Since by definition ΟNββ€ΟC\refmaxzβlogNβ+β(β£zNβ£), Lemma 15 implies that w.h.p.Β ΟN,Dβ=ΟNβ, so it is enough to prove Lemma 10 with zN replaced by z~N. Thus, we will prove the following result.
Lemma 16**.**
Let LNβ(s) denote L(iNβ(s),jNβ(s),kNβ(s)). In the context of Lemma 10 except with z~N in place of zN, with high probability
[TABLE]
We begin by estimating excursions of z~N.
Lemma 17**.**
Define cββ=Οz2β/4ΞΌzββ. Let Ο0ββ=inf{t:z~tNβ=0} and let
[TABLE]
β’
If C>1/ΞΌzβ then w.h.p.Β Ο0βββ€ClogN.
β’
E[Ο1βββΟ0ββ]β₯1/4ΞΌzβ.
β’
There are constants ΞΈ,Ξ>0 so that E[exp(ΞΈ(Ο2βββΟ0ββ))]β€Ξ for large N.
β’
With ΞΈ,Ξ as above, P(β«Ο0ββΟ2ββββ£z~sNββ£ds>3cββM+(ΞΈ+Οβ2β)M2)β€(1+3Ξ)eβΞΈm.
If z~0Nβ>0 then ΞΎtβ=eΞΌzβ(tβ§Ο0ββ)z~tβ§Ο0ββNβ is a supermartingale. Since z~tNββ₯2Nβ1/2 if Ο0ββ>t,
[TABLE]
By symmetry of z~N, the same estimate holds if βz~0Nβ=z. Since β£z~Nβ£β€N1/2+2Nβ1/2, the first statement follows by taking t=ClogN for C>1/ΞΌzβ.
To prove the second statement, let Ο=Οcββ+β(β£z~Nβ£), and note that by the strong Markov property, Ο1βββΟ0ββ is equal to distribution to Ο conditioned on z~0Nβ=0. We compute
[TABLE]
In particular, ΞΌ((z~N)2)β€Οz2β, so (z~tβ§ΟNβ)2βΟz2β(tβ§Ο) is a supermartingale. Since (z~0Nβ)2=0 and (z~ΟNβ)2β₯cβ2β, using optional stopping
[TABLE]
To prove the third statement it suffices to show that for large N, both P(Ο1βββΟ0ββ>t) and P(Ο2βββΟ1ββ>t) are bounded by some function that decays exponentially in t. We prove the two parts in the order given. Suppose β£z~0Nββ£β€cββ and let Ο=Οcββ+β(β£z~Nβ£). From (8), if β£z~Nβ£β€cββ=Οz2β/4ΞΌzββ then ΞΌ((z~N)2)β₯Οz2β/2. Moreover if β£z~Nβ£β€cββ then (z~N)2 jumps by 2(2Nβ1/2)z~Nβ(z~N)2β€4Nβ1/2cββ for large N, and jumps at rate Οz2βN/4, so Ο2((z~N)2)β€4cβ2βΟz2β.
Let Xtβ=(z~tβ§ΟNβ)2β(z~0Nβ)2, so that for Ο>0,
[TABLE]
Let Ο=1/16cβ2β so that there is Οz2β/4 in the above parentheses, noting that ΟΞββ(X)=O(Nβ1/2)β€1/2 for large N. Using Lemma 1 with a=1/Ο=16cβ2β, we find that
[TABLE]
If Ο>t then β£z~tNββ£β€cββ, so Xtββ€4(cββ)2. Denoting the constant tβ=80cβ2β/Οz2β we find that
[TABLE]
Using the Markov property to iterate, P(Ο>ktβ)β€(2/e)k, which proves the first part.
Taking now Ο=inf{t:z~N=0} and jβ the least multiple of 2Nβ1/2 larger than cββ, we bound P(Ο2βββΟ1ββ>t)=P(Ο>tβ£β£z~0Nββ£=2jβ/Nβ). Since this quantity is non-decreasing in jβ and we only need an upper bound we may assume jβ is even, and by symmetry we may assume z~N>0. For any j let Οjβ=inf{t:z~tNβ=2j/Nβ} and let Ο0,jβ=inf{t:z~tNββ{0,2j/Nβ}}. The approach is to condition on the number of commutes from 2jβ/Nβ to jβ/Nβ and back, before hitting [math]. Since z~N, stopped at zero, is a supermartingale,
[TABLE]
so the number of commutes is at most geometric(1/2). It is easy to check that if a random variable X has an exponential tail, then a geometric sum (with positive stopping probability) of i.i.d.Β copies of X itself has an exponential tail. Thus it suffices to show that both
[TABLE]
are bounded by some function that decays exponentially in t, for large N. Using the supermartingale ΞΎ defined above, it is easy to check that
[TABLE]
Then, since Ο0,jβββ€inf{t:β£z~tNββ£β₯2jβ/Nβ}, using the proof of the bound on Ο1βββΟ0ββ we deduce that P(Ο0,jββ>ktββ£z~0Nβ=jβ/Nβ)β€(2/e)k. Since jβ is even, in applying the proof we may need to replace cββ with a quantity up to 2Nβ1/2 larger, but the only effect is an o(1) change in tβ.
To prove the fourth statement, we first note that
[TABLE]
Since Ο1βββ€Ο2ββ, the third statement shows P((Ο1βββΟ0ββ)cββ>cββM)β€ΞeβΞΈM. To bound the second term we use the fact that
[TABLE]
then control the latter quantity. For ease of notation we suppose z~0Nβ=2jβ/Nβ, let Ο=inf{t:z~tNβ=0} and control suptβ€Οβz~tNβ. Define
Xtβ=z~tβ§ΟNβ, then X is a supermartingale with X0ββ€cββ+2/Nββ€2cββ for large N, and for Ο>0
[TABLE]
Using Lemma 1, if 2Ο/Nββ€1/2 then P(Xtβ>2cββ+a+Οβ2βΟ(tβ§Ο)Β forΒ someΒ tβ₯0)β€2eβΟa. Fix Ο=1. Since Ο is equal in distribution in Ο2βββΟ1ββ, which is at most Ο2βββΟ0ββ, from the third statement P(Ο>M)β€ΞeβΞΈM. Letting a=ΞΈM we find
[TABLE]
Combining with the estimate of the first term, and another estimate on Ο2βββΟ1ββ, we obtain the desired result.
β
We begin by whittling down the statement of Lemma 16 until it is ready to analyze in detail. Define
[TABLE]
In words, LNββ is equal to LNβ until ΟNβ, at which point it remains at the last value assumed by LNβ before ΟNβ. Since LNββ(s)=LNβ(s) for s<ΟNβ, the statement of Lemma 16 is unchanged if we replace LNβ with LNββ.
In the same manner as z~Nβ is coupled to z~N as described at the beginning of this section, it can be coupled to the full infection process. Recall the cNhβ,cNQβ control time ΟNβ=ΟNβ(cNhβ,cNQβ,Ο΅), defined in Definition 2 and given on the slow time scale. Define ΟN,z~β=inf{t:β£z~Nβ(t)β£β₯2C\refmaxzβlogNβ}. By Lemma 15 and the definition of ΟNβ, w.h.p.
[TABLE]
so it is enough to show the statement of Lemma 16 holds with ΟN,z~β in place of ΟNβ. As in Lemma 17 let cββ=Οz2β/4ΞΌzββ. Define Ο0ββ=inf{t:z~Nβ(t)=0} and for jβ₯0,
[TABLE]
The definition of Οiββ, i=0,1,2 differs from Lemma 17 only by the choice of time scale. We show the contribution to the integral up to time Ο0ββ can be ignored. By Lemma 17, w.h.p.Β Ο0βββ€(2/ΞΌzβ)Nβ1/2logN. Since iNβ,jNβ,kNββ€hNβ, L(0,0,0)=0 and L has Lipschitz constant cLβ in the β1 norm, β£LNβ(s)β£β€cLβhNβ(s). If s<ΟNβ then by definition hNβ(s)β€cNhβ. Since LNββ only sees the values {LNβ(s):s<ΟNβ} it follows that β£LNββ(s)β£β€cLβcNhβ for all sβ₯0. Since β£z~tNββ£β€2C\refmaxzβlogNβ for t<ΟN,z~β, using the above estimate on Ο0ββ and cNhββ€(cNhβlogN)1/2, with high probability
[TABLE]
Thus, without affecting the conclusion, we may assume that Ο0ββ=0, equivalently, z~Nβ(0)=0. At this point we will also replace tβ§ΟN,z~β with t as the upper endpoint; this does not decrease the supremum over tβ€T. To summarize thus far, it remains to show that, if z~Nβ(0)=0 and T>0 then w.h.p.,
[TABLE]
For j,kβ₯0 define ΞΎjβ=β«Ο2jββΟ2j+2βββz~Nβ(s)ds,
[TABLE]
Let I denote the LHS of (46). If KNβ is such that w.h.p.Β Ο2KNββββ₯T, then w.h.p.
[TABLE]
Since the variables {Ο2j+2βββΟ2jββ}jβ₯0β are i.i.d., by Lemma 17,
[TABLE]
and since for random variable Xβ₯0, E[ΞΈ2X2/2]β€E[eΞΈX], by Lemma 17,
[TABLE]
Letting KNβ=2T/E[Ο2βββΟ0ββ]=2NβT/Ο΅ we have E[Ο2KNβββ]=2T and Var(Ο2KNβββ)β€KNβC/N=2CT/Ο΅Nβ, so using Chebyshevβs inequality,
[TABLE]
and Ο2KNββββ₯T w.h.p., as desired. It remains to estimate the terms in (47).
For tβ₯0 let F(t) denote the information up to time t. The {ΞΎjβ}jβ₯0β are i.i.d., and by symmetry of z~N, ΞΎjβ and βΞΎjβ are equal in distribution. Because of this and since LNββ(Ο2jββ) is F(Ο2jββ)-measurable, S is a discrete time martingale. Using Doobβs L2 maximal inequality for martingales and orthogonality of martingale increments,
[TABLE]
From Lemma 17 and noting the change of time scale, there are ΞΈ,C>0 so that for large M, P(\big{(}\int_{\tau_{0}^{*}}^{\tau_{2}^{*}}|\tilde{z}_{N}(s)|ds\big{)}^{2}>CM^{4}/N)\leq Ce^{-\theta M}, which implies that
[TABLE]
for some possibly larger C>0. It follows that
[TABLE]
Noting that cNhββ€(cnhβlogN)1/2, then using Markovβs inequality we find that
[TABLE]
It remains to estimate βk<KNββGkβ. Let ΞΎβkβ denote β«Ο2kββΟ2k+2ββββ£z~Nβ(s)β£ds. Then
[TABLE]
so by the Cauchy-Schwarz inequality
[TABLE]
The first term is O(1/Nβ) by the latter part of (48). Let MkLβ denote the supremum inside the second term. To estimate E[(MkLβ)2], recall (38) and note that if s<ΟNβ then
[TABLE]
It follows that
[TABLE]
Let Mkhβ denote the above supremum. Using the simple inequality (a+b)2β€2(a2+b2),
[TABLE]
We estimate Mkhβ. If s<ΟNβ then since β£zNβ(s)β£β€C\refmaxzβlogNβ and hNβ(s)β€cNhβ, referring to (29) we have
[TABLE]
and so
[TABLE]
Since hNβ jumps by 1/Nβ at rate O(NhNβ), if s<ΟNβ then Οs2β(hNβ)=O(cNhβ).
Applying Doobβs L2-maximal inequality,
[TABLE]
Using again the inequality (a+b)2β€2(a2+b2), from the above two displays we obtain
[TABLE]
Letting t=Ο2k+2ββ and taking an expectation we find that
Next we show this implies the desired bound. Since ztNβ>0 for t<Ο by assumption, ΞΌtβ(zN)β€βrztNβ, with r as in the proof of Lemma 6. Thus if Xtββ€x then
[TABLE]
Solving by repeated substitution we find ztNββ€z0Nβeβrt+x((1βeβrt)/r+eβrt)=z0Nβeβrt+O(x). So β«0tβzsNβds=O(z0Nβ)+O(xt). By Lemma 6, Οβ€C\refmaxzβlogN w.h.p., and the result follows.
β
Recall the goal is to estimate Ο=ΟCββ(hNβ)=inf{t:hNβ(t)β€C}, as Cββ, assuming hNβ(0)=Ο(1).
We may assume Cβ₯1 so that hNβ(t)β₯1 for t<Ο. Recall from (29) that
[TABLE]
where ciβ,i=1,2,3 are positive constants, and that Ο2(hNβ)=O(hNβ).
Using the Taylor approximation of Lemma 3, if hNβ=Ο(Nβ1/2) then
[TABLE]
and combining with the previous display,
[TABLE]
Let x(t)=1/hNβ(t) and Ξ½=1/C, so that Ο=inf{t:x(t)β₯Ξ½} and x(t)<Ξ½ for t<Ο. Since hNβ(0)ββ, x(0)=o(1). From the above display, if t<Ο then
[TABLE]
Since iNββ€hNβ and hNβ(t)β₯1/Ξ½ for t<Ο, for large N
[TABLE]
where c4β is another positive constant. Let Ο1β=inf{t:β£zNβ(t)β£β€C\refmaxzβNβ1/2}. Since zNβ has constant sign on [0,Ο1β], using Lemma 18 and recalling that β£z0ββ£=o(N1/2) by assumption, w.h.p.
[TABLE]
To estimate the integral on sβ[Ο1β,t], couple zNβ to z~Nβ beginning at time Ο1β so that β£DNβ(Ο1β)β£β€2Nβ1/2. Noting that zNβ(Ο1β)β€C\refmaxzβNβ1/2, by Lemma 6 and 15, w.h.p. β£DNβ(s)β£β€Nβ1/4logN for all sβ[Ο1β,t]. Let Οkββ be as in the proof of Lemma 16 except beginning with Ο0ββ=Ο1β. Since z~Nβ(Ο1β)β[0,cββ], the value of Ο2βββΟ0ββ is not larger than if z~Nβ(Ο0ββ)=0. Following that proof, if M1β>0 is a large enough constant then w.h.p. as Nββ for fixed t, Ο2βM1βNβtββββ₯t. Since E[β£ΞΎjββ£]=O(1/Nβ), letting M2β=M1βlimsupnβ(NβE[β£ΞΎjββ£]), it follows that for large N,
[TABLE]
Using Markovβs inequality on the last display, combining with the bound on β£DNββ£, and using the fact that Ο2βM1βNβtββββ₯t w.h.p.,
[TABLE]
Combining with (54), we find that with probability β₯1βΟ΅/2βo(1),
[TABLE]
Since 1/hNβ jumps by O(Nβ1/2/hN2β) at rate O(NhNβ), Ο2(x)=Ο2(1/hNβ)β€c5β/hN3β=c5βx3 for some c5β>0. Using Lemma 1, if a>0 and Ξββ(x)Οβ€1/2 then with probability at least 1β2eβΟa, for all tβ₯0
[TABLE]
Using the above bound on x(t)p, noting x(0)=o(1) (since h(0)ββ) and Ξ½β€1, with probability β₯1β2eβΟaβΟ΅ for large N,
[TABLE]
Let Ο΅=Ξ½, a=Ξ½/4, Ο=1/Ξ½2, let M3β=2(c4β+c1βM2β+c5β) and let t=Ξ½3/M3β. If N is large then M2β/2Ο΅+o(1)β€M2β/Ο΅=M2β/Ξ½. Since Ξ½β€1 by assumption,
[TABLE]
for large N, implying Ο>t. Since Οa=1/4Ξ½ and Ο΅=Ξ½, we have shown that
[TABLE]
To obtain the upper bound we need to take one more term in the Taylor series for 1/hNβ. Expanding to third order and noting that 1/hNβ jumps by O(Nβ1/2/hN2β) at rate O(NhNβ),
[TABLE]
Since we only need an upper bound on Ο, we wait for an amount of time Ξ½β§Ο before estimating the compensator. To estimate the first term we note that L(iNβ,hNβ)=iNβ/hN2β is Lipschitz with constant cLβ=2, when hNββ₯1. By Lemma 9, we may use Lemma 10 with chβ=logN and cQβ=Nβ1/6 to find that w.h.p.,
[TABLE]
By Lemma 14, w.h.p.Β c2βiNβ(t)2/hNβ(t)2β₯c6β for all Ξ½β§Οβ€tβ€N1/2β§Ο (since Htββ₯N1/5 for tβ€Ο), and some c6β>0. Combining these observations with (56) we find that w.h.p.,
[TABLE]
Recalling that Οt2β(x)β€c5βΞ½3 for t<Ο, using Lemma 1 and the above display, if a>0 and Ξββ(x)Οβ€1/2 then with probability at least 1β2eβΟaβo(1), for tβ₯Ξ½,
[TABLE]
On the above event, if Ο>tβ₯Ξ½ then tβ§Ο=t, Ξ½β§Ο=Ξ½ and x(tβ§Ο)=x(t)<Ξ½. Taking Ο=Ξ½β2 and a=Ξ½, if Ξ½ is small enough and N large enough that c5βΞ½+o(1)β€c6β/2, then
[TABLE]
and so tβ€(1+2/c6β)Ξ½. Since our choice of Ο,a gives eβΟa=eβ1/Ξ½β0 as Ξ½β0, it follows that
Fix a positive integer m>0. There is a constant C\reflem:exitβexpβ so that if 4mΞ΄ is small enough, kβ€m and akββ₯2Nβ0.3, if hNβ(0)β(akβ1β,ak+1β) then E[Οkββ]β€C\reflem:exitβexpβakβ for large N.
Proof.
We claim that to complete the proof it is enough to find C\reflem:exitβexpβ,Ο΅>0 so that if hNβ(0)β(akβ1β,ak+1β) then
for any positive integer n.
Now the proof finishes by noting that
[TABLE]
Thus it remains to prove (57). To do so we use hN2β. If t<ΟNβ(ctrl,0) then iNβ(t)β€hNβ(t)β€logN, and as shown in the proof of Theorem 4, for some constant Οβ2β, Οt2β(hNβ)=(Οβ2β+o(1))hNβ(t). Omitting the t, from (29) we then have, for constants c1β,c2β>0,
Since kβ€m, if t<Οkββ then iNβ(t)β€hNβ(t)β€2m+1Ξ΄ so 2c2βiNβ(t)2hNβ(t)β€c2β²β4mΞ΄2hNβ(t) for some c2β²β. Thus if 4mΞ΄>0 is sufficiently small and t<Οkβββ§T, from (10)-(59) we obtain
[TABLE]
for all large N. On the other hand, if hNββ₯Nβ1/2, then hN2β jumps by O(Nβ1/2)hNβ+O(Nβ1)=O(Nβ1/2hNβ) at rate O(NhNβ). Thus if t<Οkβββ§T then Ο2(hN2β(t))=O(hN3β(t))β€c3βak+13β for some c3β>0. Noting that akβ=2akβ1β=ak+1β/2 and letting Ο=Οβ2β/(64c3βak2β), if t<Οkβββ§T then
[TABLE]
Since for t<Οkββ, hN2β(t)β€ak+12βΞ΄2=4ak2βΞ΄2, we find that w.h.p.
[TABLE]
Letting t=T=akβ, a=Ο2ak2β/16 and taking Ξ΄β€Οβ2β/32, if Οkββ>t then
[TABLE]
Since Ξββ(hN2β)=O(Nβ1/2hNβ)=O(Nβ1/2akβ),
with Ο΅=1β2eβΟa and Οa=(Οβ2β)2/(210c3β). Now the proof of the claim (57) follows by setting C\reflem:exitβexpβ=1/Ο΅. This finishes the proof of the lemma.
β
Next, we estimate the exit probabilities.
Lemma 20**.**
Fix a positive integer m>0 and Ο΅>0. Let Ξ΄,Οkβ,Οkββ be as in Lemma 19 and its proof. Assume hNβ(0)=akβ+O(Nβ1/2)β₯Nβ0.3. Then for large N and all kβ€m,
[TABLE]
Proof.
Using the facts that Οkβ is the exit time from (akβ1β,ak+1β)=(akβ/2,2akβ), Οkβββ€Οkβ and hNβ jumps by O(Nβ1/2), for any T>0
Using Lemma 19 we see that we can take T>0 large enough so that P(Οkββ>T))β€Ο΅/2, uniformly for kβ€m. Combining with the above display gives the desired result.
β
Equipped with Lemma 19 and Lemma 20 we now prove Lemma 13.
We first recall the following two facts about a simple random walk on Z with probability p<1/2 of increasing by 1 and (1βp) of decreasing by 1, at each time step.
Starting from [math] the probability to ever reach k>0 is (p/(1βp))k, and
2. 2.
starting from k, the expected number of jumps out of k is equal to 1/(1β2p).
Fix a positive integer m and suppose hNβ(0)β€Ξ΄=a0β. Using Lemma 20 and by comparison it follows that, uniformly for kβ€m
For any k>0, the probability that hNβ reaches [akβ,β) is at most (1/2+o(1))k.
2. 2.
If hNβ(t)=akβ+O(Nβ1/2), the expected number of times we perform
the step of exiting (akβ1β,ak+1β) before time ΟNβ(ctrl,0) is at most 3+o(1).
Using point 2 and summing over the expected number of exits from each level (and adding one for the initial exit, since hNβ(0) may not be equal to akβ+O(Nβ1/2) for some k) to find that
[TABLE]
where Cmβ,Dmβ are constants that depend only on m. Using Markovβs inequality,
[TABLE]
Let M=2/Ο΅ so the above probability is at most Ο΅/2. Since ΟNβ(ctrl,0)β€ΟNβ0.3ββ(hNβ), using point 1, P(ΟNβ(ctrl,0)β₯Ο2mΞ΄+β(hNβ))β0 as mββ, so take m large enough that this probability is at most Ο΅/2. Combining,
[TABLE]
Take Ξ΄>0 small enough that 2DmβΞ΄/Ο΅β€Ο΅. Since Ο2mΞ΄+β(hNβ)β€ΟlogN+β(hNβ) for large N, the result is proved.
β
Recall that Ο=inf{t:HtNβ=0Β orΒ HtNββ₯N0.24} and define
[TABLE]
Note that H0Nββ€N1/5 and that Οβ²β§N1/4β₯Οβ§N1/4 w.h.p.Β by assumption. We will show that i) Οβ²β€N1/4 w.h.p.Β and that ii) HΟβ²β<N.24 w.h.p. To deduce the result from these, first combine i) with the second assumption to find that w.h.p.
[TABLE]
and that since Οβ²β€Ο, w.h.p.Β Ο=Οβ²β€N1/4. Then, note that HΟβ is either β₯N.24 or is equal to [math], so that if Ο=Οβ² and HΟβ²β<N.24, then HΟβ=0.
Showing that Οβ²β€N1/4 w.h.p. The idea is to approximate (IN,JN,KN) by a multi-type continuous time branching process. Such processes are characterized by having transition rates that are a homogeneous linear function of the variables. In (IN,JN,KN) there are two non-linear interactions: I+I and S+I partnership formation. If t<Οβ² then since ItNββ€HtNββ€N.24, the rate at which a pair of single I form a partnership is O((IN)2/N)=O(N0.48β1)=o(Nβ1/4). Therefore, with high probability no such events occur on the interval [0,Οβ²β§N1/4]. S+I partnerships form at rate O(SNIN/N). If t<Οβ² then using the bound on β£zNβ£ (and omitting t),
[TABLE]
Thus, if we pretend the rate is yββIN (i.e., generate transitions using two independent sources of randomness, one with rate yββIN and the other with rate o(Nβ1/4)), then w.h.p.Β the process so obtained will be identical to the original process on the time interval [0,Οβ²β§N1/4].
Thus, the continuous time three-type (Markov) branching process (I,J,K) obtained by letting (I0β,J0β,K0β)=(I0Nβ,J0Nβ,K0Nβ) and ignoring I+I transitions and the non-linear part of S+I transitions is such that
[TABLE]
If (IN,JN,KN)=(0,0,0) then tβ₯Οβ², so it would be enough to show the extinction time of (I,J,K) is o(N1/4) w.h.p. We first extract an embedded one-type CMJ (non-Markov) branching process. To do this, we note the following two points:
Initial decay: each initial particle of type J,K decays at rate β₯rββ (regardless of its type) into 0,1 or 2 type I particles before ever producing additional particles of other types, and
2. 2.
Reproduction cycle: each type I particle follows the evolution described in Figure 1,
yielding 0,1 or 2 type I particles upon reaching the set {D,E,F,G}.
Since there are initially O(N0.2) particles, by point 1., with high probability, within constant times logN time every initial particle of type J,K has turned into 0,1 or 2 type I particles. Thus, since logN=o(N1/4), we may assume all initial particles have type I.
Point 2. says that we can use the Markov chain described in Figure 1 to determine the timing and number of type I offspring of each type I particle. The offspring distribution has mean R0β=1 and is supported on the set {0,1,2}. Referring to Figure 1, the waiting time to produce offspring is the absorption time at {D,E,F,G} starting from A, which is at most exponential(1+r+βyββ) + exponential(rββ).
In the embedded one-type process of type I particles, the set of descendants of any particle forms a critical Galton-Watson tree. We recall a couple of facts that hold for such trees, when the offspring distribution has finite variance. The height of the tree (maximum distance to the root) is greater than or equal to n with probability O(1/n), and the total number of vertices is greater than or equal to n with probability O(nβ1/2). Thus with O(N0.2) initial particles, with high probability the tallest tree has height O(N0.22) and the sum of tree sizes is O(N0.44). In particular there are in total O(N0.44) offspring production events. Since the waiting time for offspring is at most the sum of two exponential random variables with fixed constant rates, the longest waiting time for offspring is whp bounded by constant times logN. Bounding the waiting times by their maximum and noting the height bound, whp the process dies out within O(N0.22logN)=o(N1/4) amount of time.
Showing that HΟβ²β<N.24 w.h.p. Using the bound on β£zNβ£ and the fact that Ξ³/2<Ξ· and INβ€HN, from (28) we find that for t<Οβ²,
[TABLE]
for some constant a1β>0. For b>0 to be determined, letting f(x)=eβbx and using Taylorβs theorem, for fixed x,y we get
[TABLE]
where z is between x and y. Applying this to eβbHN, since Ξββ(HN)=O(1) we will have eβbz=eβb(x+O(1)) and (yβx)3=O(1) across jump times of HN. Noting that transition rates are bounded by O(HN) and multiplying by those transition rates, upon summing over y we obtain
Taking b=Nβ0.22 and noting that b2eO(b)=o(b) we deduce ΞΌ(eβbHN) is non-negative for large N, so the process ΞΎtβ=eβbHtβ§Οβ²Nβ is a submartingale. From the definition of Οβ², the fact that the jumps are of size O(1) and the fact that eβbHNβ€1, we use the optional stopping theorem to obtain
[TABLE]
Since H0ββ€N0.2, bH0β=o(1) and bN0.24=Ο(1), so
[TABLE]
β
11 Computing R0β
In this section we show that (19) is equivalent to the condition R0β=1. To do this we recall (1), namely the definition of R0β:
[TABLE]
where Ο is the hitting time of {D,E,F,G} for the Markov chain with rates drawn in Figure 1.
To calculate R0β we let
[TABLE]
and note that f(D)=0, f(E)=0, f(F)=1, and f(G)=2. By considering what happens on the first jump from each state we see that
To obtain the result we take the derivative, but we need to estimate the last term more carefully. By a Taylor expansion, the term under the sum is at most
Thus taking a union bound, from (67)-(68), we deduce
[TABLE]
Iterating the estimate βΞβ times, alternately stopping the process when β£Xtββx/2β£β€Ξββ(X)/2 and β£Xtββx/2β£β₯x/2, the result follows from a union bound.
Hence, taking a union bound, as mentioned above, (note that Ο2jβ1β=β for some j automatically implies suptβXtββ€x) we see
[TABLE]
Since Ξββ(X)<x it can be easily checked that if XΟ2jββ<x for all jβ€βΞβ then Xtβ<x for all tβ€Ο2βΞββ. Now the desired probability bound is immediate. This completes the proof.
β
We use the following βcontinuation trickβ. Define a new process X~ by
[TABLE]
In words, X~ is equal to X up to time Ο, at which point it decreases at a fixed deterministic speed ΞΌββ. Since tβ¦X~tβ is continuous on [Ο,β), Ξββ(X~)β€Ξββ(X). Moreover, it is easy to check that X~ satisfies (7) assuming only 0<X~tβ<x (i.e., without assuming t<Ο). Thus, Lemma 4 applies to X~. Since Xtβ=X~tβ for tβ€Ο, the result follows.
β
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Bramson, M. (1998) State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems. 30, 89β140.
2[2] Durrett, R. (2010) Probability: Theory and Examples. Fourth Edition, Cambridge U. Press.
3[3] Ethier, S.N., and Kurtz, T.G. (1986) Markov Processes: Characterization and Convergence. John Wiley and Sons, New York.
4[4] Foxall, E. (2016) Critical behaviour of the partner model. Ann. Appl. Probab. , 26(5), 2824β2859.
5[5] Foxall, E. (2016) Stochastic calculus and sample path estimation for jump processes. ar Xiv preprint ar Xiv:1607.07063 .
6[6] Foxall, E. (2017) The naming game on the complete graph. ar Xiv preprint ar Xiv:1703.02088 .
7[7] Foxall, E., Edwards, R., and van den Driessche, P. (2016) Social contact processes and the partner model. Ann. Appl. Probab. 26(3), 1297β1328.
8[8] Harrison, J.M. and Van Mieghem, J.A. (1997) Dynamic control of Brownian networks: state space collapse and equivalent workload formulations. Ann. Appl. Probab. 7, 747β771.