Skip to main content
Springer logoLink to Springer
. 2024 Mar 18;88(4):44. doi: 10.1007/s00285-024-02069-w

An approximation of populations on a habitat with large carrying capacity

Naor Bauman 1, Pavel Chigansky 1,, Fima Klebaner 2
PMCID: PMC10948565  PMID: 38498209

Abstract

We consider stochastic dynamics of a population which starts from a small colony on a habitat with large but limited carrying capacity. A common heuristics suggests that such population grows initially as a Galton–Watson branching process and then its size follows an almost deterministic path until reaching its maximum, sustainable by the habitat. In this paper we put forward an alternative and, in fact, more accurate approximation which suggests that the population size behaves as a special nonlinear transformation of the Galton–Watson process from the very beginning.

Keywords: Population dynamics, Branching processes, Limit theorems, Approximation

Introduction

The model

A large population often starts from a few individuals who colonize a new habitat. Initially, in abundance of resources and lack of competition it grows rapidly until reaching the carrying capacity. Then the population fluctuates around the carrying capacity for a very long period of time, until, by chance, it eventually dies out, see, e.g., Haccou et al. (2007); Hamza et al. (2016).

This cycle is captured by a stochastic model of density dependent branching process Z=(Zn,nZ+) generated by the recursion

Zn=j=1Zn-1ξn,j,nN, 1

started at an initial colony size Z0. The random variables ξn,j take integer values and, for each nN, are conditionally i.i.d. given all previous generations

Fn-1=σ{ξm,j:m<n,jN}.

The object of our study is the density process of the population Z¯n:=Zn/K relative to the carrying capacity parameter K>0. The common distribution of the random variables ξn,j is assumed to depend on the density Z¯n-1:

P(ξn,1=|Fn-1)=p(Z¯n-1),Z+, 2

and is determined by the functions p:R+[0,1].

Both processes Z and Z¯ are indexed by K, but this dependence is suppressed in the notation. The mean and the variance of offspring distribution when the density process has value x are denoted by

m(x)=k=0kpk(x)andσ2(x)=k=0(k-m(x))2pk(x),xR+, 3

assumed to exist. Consequently,

E(ξn,1|Fn-1)=m(Z¯n-1)andVar(ξn,1|Fn-1)=σ2(Z¯n-1).

If the offspring mean function satisfies

m(x)>1,x<1=1,x=1<1,x>1 4

the process Z has a supercritical reproduction below the capacity K, critical reproduction at K and a subcritical reproduction above K. Thus a typical trajectory of Z grows rapidly until it reaches the vicinity of K. It then stays there fluctuating for a very long period of time and gets extinct eventually if p0(x)>0 for all xR+. Thus the lifespan of such population roughly divides between the emergence stage, at which the population establishes itself, the quasi-stationary stage around the carrying capacity and the decline stage which ends up with inevitable extinction.

Remark 1

While (4) is typical for populations with quasi stable equilibrium at the capacity, it is not needed in the proofs and will not be assumed in what follows.

Large initial colony

A more quantitative picture can be obtained by considering the dynamics for the density process derived from (1) by setting f(x):=xm(x), dividing by K and rearranging:

Z¯n=f(Z¯n-1)+1Kj=1Zn-1(ξn,j-m(Z¯n-1)). 5

The second term on the right has zero mean and conditional variance

Var1Kj=1Zn-1(ξn,j-m(Z¯n-1))|Fn-1=K-1Z¯n-1σ2(Z¯n-1).

Consequently (5) can be viewed as a deterministic dynamical system perturbed by small noise of order1OP(K-1/2). If the initial colony size is relatively large, i.e., proportional to the carrying capacity:

Z¯0=Z0/KKx0>0,

then Z¯nKPxn where xn follows the unperturbed deterministic dynamics

xn=f(xn-1),nN, 6

started at x0. If (4) is assumed, x=1 is the stable fixed point of f and if, in addition, f is an increasing function, then the sequence xn increases to 1 with n when x0<1. This limit also implies that the probability of early extinction tends to zero as K.

Moreover, the stochastic fluctuations about the deterministic limit converge to a Gaussian process V=(Vn,nZ+) in distribution:

K(Z¯n-xn)KdVn

where Vn satisfies the recursion, Klebaner and Nerman (1994),

Vn=f(xn-1)Vn-1+xn-1σ2(xn-1)Wn,nN,

with N(0, 1) i.i.d. random variables Wn’s.

Roughly speaking, this implies that when K is large, Zn grows towards the capacity K along the deterministic path Kxn and its fluctuations are of order OP(K1/2):

Zn=xnK+VnK1/2+oP(K1/2),nN. 7

If p0(x)>0 for all xR+ and (4) is imposed, zero is an absorbing state and hence the population gets extinct eventually. Large deviations analysis, see for example Klebaner and Zeitouni (1994); Klebaner et al. (1998), and Jung (2013); Högnäs (2019), shows that the mean of the time to extinction τe=inf{n0:Zn=0} grows exponentially with K. In this paper we are concerned with the establishment stage of the population, which occurs well before the ultimate extinction, on the time scale of logK.

Small initial colony

When Z0 is a fixed integer, say Z0=1, then Z0/Kx0=0 and, since f(0)=0, the solution to (6) is xn=0 for all nN. In this case the approximation (7) ceases to provide useful information. An alternative way to describe the stochastic dynamics in this setting was suggested recently in Barbour et al. (2016); Chigansky et al. (2018, 2019). It is based on the long known heuristics (Kendall 1956; Whittle 1955; Metz 1978), according to which such a population behaves initially as the Galton–Watson branching process and, if it manages to avoid extinction at this early stage, it continues to grow towards the carrying capacity following an almost deterministic curve.

This heuristics is made precise in Chigansky et al. (2019) as follows. We couple Z to a supercritical Galton–Watson branching process Y=(Yn,nZ+) started at Y0=Z0=1,

Yn=j=1Yn-1ηn,j 8

with the offspring distribution identical to that of Z at zero density size

P(η1,1=)=p(0),Z+.

This coupling is defined under assumption (a1.) below in Sect. 3.2.

Denote by ρ:=m(0)>1, define2nc:=nc(K)=[logρKc] for some c(12,1) and let Y¯n:=Yn/K be the density of Y. Then Z¯n=Zn/K is approximated in Chigansky et al. (2019) by

Y¯n,nnc,fn-nc(Y¯nc),n>nc,

where fk stands for the k-th iterate of f. As is well known (Athreya and Ney 1972)

ρ-nYnnP-a.s.W,

where W is an a.s. finite random variable. Moreover, under certain technical conditions on f, the limit

H(x):=limnfn(x/ρn),xR+ 9

can be shown to exist and define a continuous function.

Theorem 1

(Chigansky et al. 2019) Let n1:=n1(K)=[logρK] then

Z¯n1-H(Wρ-{logρK})KP0. 10

In particular, this result implies that when K is a large integer power of ρ the distribution of Z¯n1 is close to that of H(W). Moreover,

Z¯n1+nKPxn,nN,

where xn solves (6) started from the random initial condition H(W). This approximation also captures the early extinction event since H(0)=0 and P(W=0)=P(limnYn=0), the extinction probability of the Galton–Watson process Y.

This paper’s contribution

In this paper we address the question of the rate of convergence in (10). Note that if the probabilities in (2) are constant with respect to x then f(x)=ρx, consequently H(x)=x, and the processes Z and Y coincide. In this case

K(Y¯n1-Wρ-{logρK})=ρ-12{logρK}ρn1(ρ-n1Yn1-W)=OP(1) 11

where the order of convergence is implied by the CLT for the Galton–Watson process (Heyde 1970) by which ρn(ρ-nYn-W) converges in distribution to a mixed normal law as n. Thus it can be expected that at best the sequence in (10) is of order OP(K-1/2) as K. However, the best rate of convergence in the approximation in Theorem 1 described above, is achieved with c=58 and it is only OP(K-1/8logK). This can be seen from a close examination of the proof in Chigansky et al. (2019).

The goal of this paper is to put forward a different approximation with much faster rate of convergence of order OP(K-1/2logK). This is still slower than the rate achievable in the density independent case, but only by a logarithmic factor. The new proof highlights a better understanding of population dynamics at the emergence stage, which shows that, in fact, a sharper approximation is given by the Galton–Watson process transformed by a nonlinear function H arising in deterministic dynamics (9).

It is not clear at the moment whether the logK factor is avoidable and whether a central limit type theorem holds. These questions are left for further research.

The main result

We will make the following assumptions.

  1. The offspring distribution Fx(t)=tp(x) is stochastically decreasing with respect to the population density: for any yx,
    Fy(t)Fx(t),tR+.
  2. The second moment of the offspring distribution, cf. (3),
    m2(x)=σ2(x)+m(x)2
    is L-Lipschitz for some L>0.
  3. The function f(x)=xm(x) has two continuous bounded derivatives and3
    f=f(0)=ρ.

Remark 2

Assumption (a1.) means that the reproduction drops with population density. In particular, it implies that xm(x) is a decreasing function and hence,

f(x)=m(x)+xm(x)m(x)ρ,xR+,

which is only slightly weaker than (a3.). The assumption (a2.) is technical.

Remark 3

The distribution of the process Z¯ does not depend on the values of {p(0),Z+} for any K, while the distribution of W and, therefore, of H(W) does. This is not a contradiction since our assumptions imply continuity of xp(x) at x=0 for all Z+. Indeed, m(x)=0(1-Fx(t))dt and therefore

0(Fx(t)-F0(t))dt=m(0)-m(x)x00

where the convergence holds since m(x) is differentiable and a fortiori continuous at x=0. By the stochastic order assumption (a1.), Fx(t)-F0(t)0 for any t0. Since both Fx and F0 are discrete with jumps at integers, for any s0,

Fx(s)-F0(s)=[s][s]+1(Fx(t)-F0(t))dt0(Fx(t)-F0(t))dtx00.

This in turn implies that p(x)p(0) as x0 for all .

Theorem 2

Under assumptions (a1.)–(a3.)

Z¯n1-H(Wρ-{logρK})=OP(K-1/2logK),asK.

Example 1

The binary splitting model from Chigansky et al. (2018) satisfies the above assumptions. Another example is Geometric offspring distribution

p(x)=q(x)(1-q(x)),Z+

where q:R+[0,1] is a decreasing function. This distribution satisfies the stochastic order condition (a1.). The normalization m(0)=ρ and m(1)=1 implies that q(0)=ρ/(1+ρ) and q(1)=1/2. A direct calculation shows that, e.g.,

q(x)=ρ1+ρexp-xlog2ρ1+ρ,x0

satisfies both (a2.) and (a3.).

Example 2

Stochastic Ricker model (Högnäs 1997) is given by a density dependent branching process with the offspring distribution

p(x)=qe-γx,

where γ>0 is a constant, q, 1 is a given probability distribution, and no offspring are produced with probability 1-e-γx. This model satisfies the stochastic ordering assumption (a1.). The mean value of the distribution q is denoted by er, to emphasize the relation to the deterministic Ricker model. With such notation,

m(x)=er-γx,f(x)=xer-γx.

Under normalization m(0)=ρ and m(1)=1 this becomes

m(x)=ρ1-x,f(x)=xρ1-x.

A direct calculation verifies the assumptions (a2.) and (a3.).

Proof of Theorem 2

We will construct the process Z defined in (1) and the Galton–Watson process Y from (8) on a suitable probability space so that YnZn for all nN and the trajectories of these processes remain sufficiently close at least for relatively small n’s (Sect. 3.2). We will then show that H is twice continuously differentiable (Sect. 3.1) and use Taylor’s approximation to argue (Sect. 3.3) that

Z¯n1-H(Y¯n1)=OP(K-1/2logK),asK.

This convergence combined with (11) implies the result. Below we will write C for a generic constant whose value may change from line to line.

Properties of H

In this section we establish existence of the limit (9) under the standing assumptions and verify its smoothness. The proof of existence relies on a result on functional iteration, shown in Baker et al. (2020).

Lemma 3

(Baker et al. 2020, Lemma 1) Let xm,n be the sequence generated by the recursion

xm,n=ρxm-1,n(1+Cxm-1,n),m=1,,n

subject to the initial condition x0,n=x/ρn>0, where ρ>1 and C0 are constants. There exists a locally bounded function ψ:R+R+ such that for any nN

xm,nψ(x)ρm-n,m=1,,n. 12

Throughout we will use the notation Hn(x):=fn(x/ρn).

Lemma 4

Under assumption (a3.) there exists a continuous function H:R+R+ and a locally bounded function g:R+R+ such that

|Hn(x)-H(x)|g(x)ρ-n,nN.

Proof

By assumption (a3.)

f(x)=ρx+0x0tf(s)dsdt 13

and hence for any x,yR+

|f(y)-f(x)|ρ|y-x|+12f|y2-x2|ρ(1+C|y||x|)|y-x| 14

with C=f/ρ. Thus the sequence xm,n:=fm(x/ρn) satisfies

xm,n=f(xm-1,n)ρ(1+Cxm-1,n)xm-1,n

and x0,n=x/ρn. By Lemma 3 there exists a locally bounded function ψ such that for any nN

|fm(x/ρn)|ψ(x)ρm-n,m=1,,n. 15

The bound (14) also implies

|fm+1(x/ρn+1)-fm(x/ρn)|=|ffm(x/ρn+1)-ffm-1(x/ρn)|ρ(1+CFm,n)|fm(x/ρn+1)-fm-1(x/ρn)| 16

where, in view of (15),

Fm,n:=fm(x/ρn+1)fm-1(x/ρn)ψ(x)ρm-1-n.

Since f has bounded second derivative and f(0)=ρ, cf. (13),

|f(x/ρn+1)-x/ρn|12f(x/ρ)2ρ-2n.

Plugging this bound into (16) and iterating n times we obtain

|fn+1(x/ρn+1)-fn(x/ρn)||f(x/ρn+1)-x/ρn|ρnm=1n(1+CFm,n)12f(x/ρ)2ρ-2nρnm=1n(1+Cψ(x)ρm-1-n)g~(x)ρ-n

where we defined

g~(x):=12f(x/ρ)2k=1(1+Cψ(x)ρ-k).

Thus the limit H(x)=limnfn(x/ρn) exists and satisfies the claimed bound with g(x)=g~(x)/(1-ρ-1). Continuity of H follows since Hn are continuous for each n and the convergence is uniform on compacts.

Corollary 5

f is topologically semiconjugate to its linearization at the origin:

H(x)=fH(x/ρ),xR+.

Proof

Since f is continuous

H(x)=limnfn+1(x/ρn+1)=limnffn((x/ρ)ρ-n)=fH(x/ρ).

The next lemma shows that H is strictly increasing in a vicinity of the origin and is therefore a local conjugacy.

Lemma 6

There exists an a>0 such that H is strictly increasing on [0, a] and

f(x)=H(ρH-1(x)),x[0,H(a)]. 17

Proof

Let c:=f and r:=ρ/c then

f(x)ρ-cx>0,x[0,r).

Since f is ρ-Lipschitz and f(0)=0, for any j=1,,n and x[0,r),

fn-j(x/ρn)x/ρj[0,r)

and hence for all x[0,r)

Hn(x)=j=1n1ρf(fn-j(x/ρn))j=1n(1-cρfn-j(x/ρn))j=1n(1-cρxρ-j)1-cρxj=1nρ-j1-cρ-1x,

where we used the Bernoulli inequality. Thus we can choose a number a(0,r) such that Hn(x)1/2 for all x[0,a]. It then follows that for any y>x in the interval [0, a]

Hn(y)-Hn(x)=xyHn(t)dt12(y-x)>0.

Taking the limit n implies that H is strictly increasing on [0, a]. Being continuous, H is invertible and (17) holds by Corollary 5.

Remark 4

Under additional assumption that f is strictly increasing on the whole R+, the function H is furthermore a global conjugacy, i.e. (17) holds on R+.

The next lemma establishes differentiability of H.

Lemma 7

H has continuous derivative

H(x)=j=11ρf(H(xρ-j)),xR+ 18

where the series converges uniformly on compacts.

Proof

Step 1. Let us first argue that the infinite product in (18)

G(x):=j=11ρf(H(xρ-j)) 19

is well defined. By assumption (a3.), f is ρ-Lipschitz and hence fn is ρn-Lipschitz. Consequently, Hn is 1-Lipschitz for all nN and so is H. This will be used in the proof on several occasions. Let c:=f and r:=12ρ/c, then

f(x)ρ-cx>0,x[0,r]. 20

For x>0 define the function j(x):=[logρ(x/r)]. Then for any j>j(x),

|log1ρf(H(xρ-j))|=-log1ρf(H(xρ-j))-log(1-cρH(xρ-j))2cρH(xρ-j)2cρxρ-j=:Cxρ-j, 21

where holds since -log(1-u)2u for all u[0,12]. The partial products in (19) can be written as

Gn(x):=j=1n1ρf(H(xρ-j))=j=1j(x)1ρf(H(xρ-j))expj=j(x)+1nlog1ρf(H(xρ-j))=:T(x)exp(Ln(x)).

In view of the estimate (21), Gn(x) converges to G(x):=T(x)exp(L(x)) for any xR+ where L(x)=limnLn(x). Furthermore,

|Gn(x)-G(x)|=|T(x)||exp(Ln(x))-exp(L(x))|exp(L(x)Ln(x))|L(x)-Ln(x)| 22

where we used the bound |T(x)|1. For any R>0 and all x[0,R] the estimate (21) implies

|L(x)-Ln(x)|=j=n+1|log1ρf(H(xρ-j))|j=n+1Cxρ-jCRρ-nρ-1,

and thus, in view of the bound (22), we obtain

supxR|Gn(x)-G(x)|0. 23

Since Gn is continuous for any n, this uniform convergence implies that G is continuous as well.

Step 2. To show that H(x) is differentiable and to verify the claimed formula for the derivative, it remains to show that the sequence of derivatives

Hn(x)=j=1n1ρf(fn-j(x/ρn))

converges to G uniformly on compacts. Fix an R>0, define J(R)=[logρ(R/r)] and, for n>J(R), let

P~n(x):=j=1J(R)1ρf(fn-j(x/ρn)),Pn(x):=j=J(R)+1n1ρf(fn-j(x/ρn))

and

Q~n(x):=j=1J(R)1ρf(H(xρ-j)),Qn(x):=j=J(R)+1n1ρf(H(xρ-j)).

Since f=ρ all these functions are bounded by 1 and

|Hn(x)-G(x)||Hn(x)-Gn(x)|+|Gn(x)-G(x)|=|P~n(x)Pn(x)-Q~n(x)Qn(x)|+|Gn(x)-G(x)||Pn(x)-Qn(x)|+|P~n(x)-Q~n(x)|+|Gn(x)-G(x)|.

Since f is continuous and the convergence HnH is uniform on compacts, it follows that

supxR|P~n(x)-Q~n(x)|=supxRj=1J(R)1ρf(Hn-j(xρ-j))-j=1J(R)1ρf(H(xρ-j))n0,

and hence, to complete the proof, we need to show that

supxR|Pn(x)-Qn(x)|n0. 24

To this end, in view of Corollary 5,

H(xρ-j)=fH(xρ-j-1))=f2H(xρ-j-2))==fn-jH(xρ-j-(n-j))=fn-jH(xρ-n)

and hence

Pn(x)-Qn(x)=j=J(R)+1n1ρf(fn-j(xρ-n))-j=J(R)+1n1ρf(fn-j(H(xρ-n))).

Consequently, for all x(0,R],

|logPn(x)-logQn(x)|j=J(R)+1n|log1ρf(fn-j(xρ-n))-log1ρf(fn-j(H(xρ-n)))|1ρ-crfj=J(R)+1n|fn-j(xρ-n)-fn-j(H(xρ-n))|1ρ-crfj=1nρn-j|xρ-n-H(xρ-n)|Cρn|ρ-nx-H(xρ-n)|=Cρn|HH-1(xρ-n)-H(xρ-n)|C|ρnH-1(xρ-n)-x|. 25

Here the bound holds since for j>J(R) both arguments of f are smaller than r and thus (20) applies. The inequality is true since H is 1-Lipschitz. The inverses in the last line of (25) are well defined for nk:=[logρ(R/H(a))]+1 where a is the constant guaranteed by Lemma 6. Moreover, for all such n

|ρnH-1(xρ-n)-x|=ρk|ρn-kH-1(xρ-kρ-(n-k))-xρ-k|=ρk|H-1fn-k(xρ-kρ-(n-k))-xρ-k|=ρk|H-1Hn-k(xρ-k)-xρ-k|n0. 26

Moreover, the sequence of functions Dn(x):=ρnH-1(xρ-n) is decreasing on [0, R] for all n large enough:

Dn+1(x)=ρnρH-1(xρ-n-1)=ρnH-1f(xρ-n-1)ρnH-1(xρ-n)=Dn(x),

where the inequality holds since H-1 is increasing near the origin. It follows now from Dini’s theorem that the convergence in (26) is uniform:

supxR|ρnH-1(xρ-n)-x|n0.

The convergence in (24) holds since both Qn and Pn are bounded by 1 and

supxR|Pn(x)-Qn(x)|supxR|Pn(x)Qn(x)|supxR|logPn(x)-logQn(x)|n0.

Lemma 8

H has continuous second derivative

H(x)=H(x)i=1f(H(xρ-i))f(H(xρ-i))H(xρ-i)ρ-i. 27

Proof

The partial products in (18)

Gn(x):=j=1n1ρf(H(xρ-j))

satisfy

Gn(x)=i=1nj=1,jin1ρf(H(xρ-j))1ρf(H(xρ-i))H(xρ-i)ρ-i=Gn(x)i=1nf(H(xρ-i))f(H(xρ-i))H(xρ-i)ρ-i,

where the convention 0/0=0 is used. By assumption (a3.), f/f is bounded uniformly on a vicinity of the origin. H is continuous by Lemma 7 and therefore is bounded on compacts. Hence the series is compactly convergent. By Lemma 7, so is Gn. Thus Gn(x) converges compactly, its limit is continuous and coincides with H(x).

The auxiliary Galton–Watson process

Let (Un,j:nN,jZ+) be an array of i.i.d. U([0, 1]) random variables and define

ξn,j(x)=Fx-1(Un,j):=min{t0:Fx(t)Un,j},

where Fx(t) is the offspring distribution function when the population density is x, cf. assumption (a1.). Then P(ξn,j(x)=k)=pk(x) for all kZ+. Let ηn,j:=ξn,j(0). By assumption (a1.)

ξn,j(x)ηn,jxR+,n,jN. 28

Let Z=(Zn,nZ+) and Y=(Yn,nZ+) be processes generated by the recursions

Zn=j=1Zn-1ξn,j(Z¯n-1)andYn=j=1Yn-1ηn,j

started from the same initial conditions Z0=Y0=1. By construction these processes coincide in distribution with (1) and (8) respectively. Moreover, in view of (28), by induction

ZnYn,nZ+. 29

The approximation

In view of (11),

Y¯n1-Wρ-{logρK}=ρ-{logρK}(ρ-n1Yn1-W)=OP(ρ-n1/2)=OP(K-1/2).

Since H has continuous derivative it follows that

H(Y¯n1)-H(Wρ-{logρK})=OP(K-1/2).

Thus to prove the assertion of Theorem 2 it remains to show that

Z¯n1-H(Y¯n1)=OP(K-1/2logK),K.

The process Y¯n=K-1Yn satisfies

Y¯n=ρY¯n-1+1Kj=1Yn-1(ηn,j-ρ).

By Taylor’s approximation and in view of Corollary 5

H(Y¯n)=H(ρY¯n-1)+H(ρY¯n-1)1Kj=1Yn-1(ηn,j-ρ)+Rn(K)=f(H(Y¯n-1))+H(ρY¯n-1)1Kj=1Yn-1(ηn,j-ρ)+Rn(K) 30

where

Rn(K):=12H(θn-1(K))1Kj=1Yn-1(ηn,j-ρ)2 31

with θn-1(K)0 satisfying

|θn-1(K)-ρY¯n-1|1Kj=1Yn-1(ηn,j-ρ). 32

Since f=ρ is assumed, f is ρ-Lipschitz. By subtracting equation (5) from (30) we obtain the bound for δn:=|H(Y¯n)-Z¯n|:

δnρδn-1+|εn(1)|+|εn(2)|+|εn(3)|+|Rn(K)| 33

subject to δ0=|H(1/K)-1/K|, where we defined

εn(1)=(H(ρY¯n-1)-1)1Kj=1Yn-1(ηn,j-ρ),εn(2)=1Kj=1Zn-1((ηn,j-ρ)-(ξn,j(Z¯n-1)-m(Z¯n-1))),εn(3)=1Kj=Zn-1+1Yn-1(ηn,j-ρ).

Consequently,

δnρnδ0+j=1nρn-j(|εj(1)|+|εj(2)|+|εj(3)|+|Rj(K)|)

and it is left to show that the contribution of each term at time n1=[logρK] is of order OP(K-1/2logK) as K.

Contribution of the initial condition

Since H(0)=0 and, by (18), H(0)=1, Taylor’s approximation implies that for all K large enough

δ0=|H(1/K)-1/K|12supx1|H(x)|K-2=CK-2

and, consequently, |ρn1δ0|CK-1.

Contribution of Rn(K)

To estimate the residual, defined in (31), let us show first that the family of random variables

maxmn1|H(θm(K))| 34

is bounded in probability as K. By equation (32),

Eθn-1(K)ρEY¯n-1+E1Kj=1Yn-1(ηn,j-ρ)ρEY¯n-1+1KEYn-1σ2(0)1Kρn+1Kρnσ2(0)K-1ρn+CK-1ρn/22CK-1ρn.

If H is bounded then (34) is obviously bounded. Let us proceed assuming that H is unbounded. Define ψ(M):=maxxM|H(x)|. By continuity, ψ(M) is finite, continuous and increases to . Let ψ-1 be its generalized inverse

ψ-1(t)=inf{x0:ψ(x)t}.

Since ψ is continuous and unbounded, ψ-1 is nondecreasing (not necessarily continuous) and ψ-1(t) as t. Then for any R0, by the union bound,

P(maxmn1|H(θm(K)|R)P(maxmn1ψ(θm(K))R)m=1n1P(ψ(θm(K))R)m=1n1P(θm(K)ψ-1(R))m=1n1Eθm(K)ψ-1(R)1ψ-1(R)m=1n12CK-1ρmρρ-12Cψ-1(R)R0.

This proves that (34) is bounded in probability. The contribution of Rn(K) in (33) can now be bounded as

m=1n1ρn1-mRm(K)maxjn1|H(θj(K))|m=1n1ρn1-m1Kj=1Ym-1(ηm,j-ρ)2

where

Em=1n1ρn1-m1Kj=1Ym-1(ηm,j-ρ)2=m=1n1ρn1-m1K2EYm-1σ2(0)m=1n1ρn1-m1K2ρmσ2(0)CK-1logK.

Hence

m=1n1ρn1-mRm(K)=OP(1)OP(K-1logK)=OP(K-1logK).

Contribution of ε(3)

By conditional independence of ηn,j’s

E(εm(3))2=σ2(0)KE(Y¯m-1-Z¯m-1).

In view of (29), the sequence Dm:=Y¯m-Z¯m0 satisfies

EDm=1KEj=1Ym-1ηm,j-j=1Zm-1ξm,j(Z¯m-1)=1KEj=Zm-1+1Ym-1ηm,j+1KEj=1Zm-1(ηm,j-ξm,j(Z¯m-1))=ρEDm-1+1KEj=1Zm-1(ρ-m(Z¯m-1))=ρEDm-1+EZ¯m-1(ρ-m(Z¯m-1))=ρEDm-1+E(ρZ¯m-1-f(Z¯m-1))ρEDm-1+12fEZ¯m-12ρEDm-1+CK-2ρ2m,

where the last bound holds in view of (29) and the well known formula for the second moment of the Galton–Watson process. Since D0=0 it follows that

EDm=1mρm-CK-2ρ2CK-2ρ2m.

Hence the contribution of ε(3) in (33) is bounded by

E|m=1n1ρn1-mεm(3)|Cm=1n1ρn1-mK-1/2EDmCm=1n1ρn1-mK-1/2K-1ρmCK-1/2logK.

Contribution of ε(2)

By assumption (a2.),

E(εm(2))2=K-2Ej=1Zm-1(ηm,j-ξm,j(Z¯m-1)-(ρ-m(Z¯m-1)))2K-2Ej=1Zm-1(ηm,j-ξm,j(Z¯m-1))2K-2Ej=1Zm-1(m2(0)-m2(Z¯m-1))K-2Ej=1Zm-1LZ¯m-1CK-3ρ2m

where holds by (28). Hence ε(2) contributes

E|m=1n1ρn1-mεm(2)|Cm=1n1ρn1-mK-3/2ρmCK-1/2logK.

Contribution of ε(1)

The function g(x):=H(x)-1 is continuously differentiable with g(0)=0 and thus Taylor’s approximation gives

εn(1)=g(ρY¯n-1)1Kj=1Yn-1(ηn,j-ρ)=g(ζn-1(K))ρY¯n-11Kj=1Yn-1(ηn,j-ρ)

where ζn-1(K) satisfies 0ζn-1(K)ρY¯n-1. Here

E|Y¯n-11Kj=1Yn-1(ηn,j-ρ)|E(Y¯n-1)21/2E(1Kj=1Yn-1(ηn,j-ρ))21/2(K-2ρ2n)1/2(K-2EYn-1σ2(0))1/2CK-2ρ3/2n.

It follows that

Em=1n1ρn1-m|Y¯m-11Kj=1Ym-1(ηm,j-ρ)|m=1n1ρn1-mCK-2ρ3/2mCK-1/2.

It is then argued as in Sect. 3.3.2 that

m=1n1ρn1-mεm(1)=OP(1)OP(K-1/2)=OP(K-1/2).

Acknowledgements

The research was supported by ARC grant DP220100973.

Funding

Open access funding provided by Hebrew University of Jerusalem.

Footnotes

1

The usual notations for probabilistic orders is used throughout. In particular, for a sequence of random variables ζ(K) and a sequence of numbers α(K)0 as K, the notation ζ(K)=OP(α(K)) means that the sequence α(K)-1ζ(K) is bounded in probability.

2

[x] and {x}=x-[x] denote the integer and fractional part of xR+.

3

f=supx|f(x)|

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  1. Athreya KB, Ney PE (1972) Branching processes. Die Grundlehren der mathematischen Wissenschaften, Band 196, p 287. Springer, New York
  2. Baker J, Chigansky P, Jagers P, Klebaner FC. On the establishment of a mutant. J Math Biol. 2020;80(6):1733–1757. doi: 10.1007/s00285-020-01478-x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  3. Barbour AD, Chigansky P, Klebaner FC. On the emergence of random initial conditions in fluid limits. J Appl Probab. 2016;53(4):1193–1205. doi: 10.1017/jpr.2016.74. [DOI] [Google Scholar]
  4. Chigansky P, Jagers P, Klebaner FC. What can be observed in real time PCR and when does it show? J Math Biol. 2018;76(3):679–695. doi: 10.1007/s00285-017-1154-1. [DOI] [PMC free article] [PubMed] [Google Scholar]
  5. Chigansky P, Jagers P, Klebaner FC. Populations with interaction and environmental dependence: from few, (almost) independent, members into deterministic evolution of high densities. Stoch Models. 2019;35(2):108–118. doi: 10.1080/15326349.2019.1575755. [DOI] [Google Scholar]
  6. Haccou P, Jagers P, Vatutin VA (2007) Branching processes: variation, growth, and extinction of populations. Cambridge studies in adaptive dynamics, vol. 5, p 316. Cambridge University Press, Cambridge, IIASA, Laxenburg
  7. Hamza K, Jagers P, Klebaner FC. On the establishment, persistence, and inevitable extinction of populations. J Math Biol. 2016;72(4):797–820. doi: 10.1007/s00285-015-0903-2. [DOI] [PubMed] [Google Scholar]
  8. Heyde CC. A rate of convergence result for the super-critical Galton-Watson process. J Appl Probab. 1970;7(2):451–454. doi: 10.2307/3211980. [DOI] [Google Scholar]
  9. Högnäs G. On the quasi-stationary distribution of a stochastic Ricker model. Stoch Process Appl. 1997;70(2):243–263. doi: 10.1016/S0304-4149(97)00064-1. [DOI] [Google Scholar]
  10. Högnäs G. On the lifetime of a size-dependent branching process. Stoch Models. 2019;35(2):119–131. doi: 10.1080/15326349.2019.1578241. [DOI] [Google Scholar]
  11. Jung B. Exit times for multivariate autoregressive processes. Stoch Process Appl. 2013;123(8):3052–3063. doi: 10.1016/j.spa.2013.03.003. [DOI] [Google Scholar]
  12. Kendall DG (1956) Deterministic and stochastic epidemics in closed populations. In: Proceedings of the third Berkeley symposium on mathematical statistics and probability, 1954–1955, vol. IV, pp 149–165. University of California Press, Berkeley-Los Angeles, CA
  13. Klebaner FC, Nerman O. Autoregressive approximation in branching processes with a threshold. Stoch Process Appl. 1994;51(1):1–7. doi: 10.1016/0304-4149(93)00000-6. [DOI] [Google Scholar]
  14. Klebaner FC, Zeitouni O. The exit problem for a class of density-dependent branching systems. Ann Appl Probab. 1994;4(4):1188–1205. doi: 10.1214/aoap/1177004911. [DOI] [Google Scholar]
  15. Klebaner FC, Lazar J, Zeitouni O. On the quasi-stationary distribution for some randomly perturbed transformations of an interval. Ann Appl Probab. 1998;8(1):300–315. doi: 10.1214/aoap/1027961045. [DOI] [Google Scholar]
  16. Metz JAJ. The epidemic in a closed population with all susceptibles equally vulnerable; some results for large susceptible populations and small initial infections. Acta Biotheor. 1978;27(1):75–123. doi: 10.1007/BF00048405. [DOI] [PubMed] [Google Scholar]
  17. Whittle P. The outcome of a stochastic epidemic: a note on Bailey’s paper. Biometrika. 1955;42(1–2):116–122. doi: 10.1093/biomet/42.1-2.116. [DOI] [Google Scholar]

Articles from Journal of Mathematical Biology are provided here courtesy of Springer

RESOURCES