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 generated by the recursion
| 1 |
started at an initial colony size . The random variables take integer values and, for each , are conditionally i.i.d. given all previous generations
The object of our study is the density process of the population relative to the carrying capacity parameter . The common distribution of the random variables is assumed to depend on the density :
| 2 |
and is determined by the functions .
Both processes Z and 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
| 3 |
assumed to exist. Consequently,
If the offspring mean function satisfies
| 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 for all . 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 , dividing by K and rearranging:
| 5 |
The second term on the right has zero mean and conditional variance
Consequently (5) can be viewed as a deterministic dynamical system perturbed by small noise of order1. If the initial colony size is relatively large, i.e., proportional to the carrying capacity:
then where follows the unperturbed deterministic dynamics
| 6 |
started at . If (4) is assumed, is the stable fixed point of f and if, in addition, f is an increasing function, then the sequence increases to 1 with n when . This limit also implies that the probability of early extinction tends to zero as .
Moreover, the stochastic fluctuations about the deterministic limit converge to a Gaussian process in distribution:
where satisfies the recursion, Klebaner and Nerman (1994),
with N(0, 1) i.i.d. random variables ’s.
Roughly speaking, this implies that when K is large, grows towards the capacity K along the deterministic path and its fluctuations are of order :
| 7 |
If for all 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 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 .
Small initial colony
When is a fixed integer, say , then and, since , the solution to (6) is for all . 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 started at ,
| 8 |
with the offspring distribution identical to that of Z at zero density size
This coupling is defined under assumption (a1.) below in Sect. 3.2.
Denote by , define2 for some and let be the density of Y. Then is approximated in Chigansky et al. (2019) by
where stands for the k-th iterate of f. As is well known (Athreya and Ney 1972)
where W is an a.s. finite random variable. Moreover, under certain technical conditions on f, the limit
| 9 |
can be shown to exist and define a continuous function.
Theorem 1
(Chigansky et al. 2019) Let then
| 10 |
In particular, this result implies that when K is a large integer power of the distribution of is close to that of H(W). Moreover,
where solves (6) started from the random initial condition H(W). This approximation also captures the early extinction event since and , 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 , consequently , and the processes Z and Y coincide. In this case
| 11 |
where the order of convergence is implied by the CLT for the Galton–Watson process (Heyde 1970) by which converges in distribution to a mixed normal law as . Thus it can be expected that at best the sequence in (10) is of order as . However, the best rate of convergence in the approximation in Theorem 1 described above, is achieved with and it is only . 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 . 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 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.
- The offspring distribution is stochastically decreasing with respect to the population density: for any ,
- The second moment of the offspring distribution, cf. (3),
is L-Lipschitz for some . - The function has two continuous bounded derivatives and3
Remark 2
Assumption (a1.) means that the reproduction drops with population density. In particular, it implies that is a decreasing function and hence,
which is only slightly weaker than (a3.). The assumption (a2.) is technical.
Remark 3
The distribution of the process does not depend on the values of 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 at for all . Indeed, and therefore
where the convergence holds since m(x) is differentiable and a fortiori continuous at . By the stochastic order assumption (a1.), for any . Since both and are discrete with jumps at integers, for any ,
This in turn implies that as for all .
Theorem 2
Under assumptions (a1.)–(a3.)
Example 1
The binary splitting model from Chigansky et al. (2018) satisfies the above assumptions. Another example is Geometric offspring distribution
where is a decreasing function. This distribution satisfies the stochastic order condition (a1.). The normalization and implies that and . A direct calculation shows that, e.g.,
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
where is a constant, , is a given probability distribution, and no offspring are produced with probability . This model satisfies the stochastic ordering assumption (a1.). The mean value of the distribution is denoted by , to emphasize the relation to the deterministic Ricker model. With such notation,
Under normalization and this becomes
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 for all 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
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
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 be the sequence generated by the recursion
subject to the initial condition , where and are constants. There exists a locally bounded function such that for any
| 12 |
Throughout we will use the notation .
Lemma 4
Under assumption (a3.) there exists a continuous function and a locally bounded function such that
Proof
By assumption (a3.)
| 13 |
and hence for any
| 14 |
with . Thus the sequence satisfies
and . By Lemma 3 there exists a locally bounded function such that for any
| 15 |
The bound (14) also implies
| 16 |
where, in view of (15),
Since f has bounded second derivative and , cf. (13),
Plugging this bound into (16) and iterating n times we obtain
where we defined
Thus the limit exists and satisfies the claimed bound with . Continuity of H follows since are continuous for each n and the convergence is uniform on compacts.
Corollary 5
f is topologically semiconjugate to its linearization at the origin:
Proof
Since f is continuous
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 such that H is strictly increasing on [0, a] and
| 17 |
Proof
Let and then
Since f is -Lipschitz and , for any and ,
and hence for all
where we used the Bernoulli inequality. Thus we can choose a number such that for all . It then follows that for any in the interval [0, a]
Taking the limit 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 , the function H is furthermore a global conjugacy, i.e. (17) holds on .
The next lemma establishes differentiability of H.
Lemma 7
H has continuous derivative
| 18 |
where the series converges uniformly on compacts.
Proof
Step 1. Let us first argue that the infinite product in (18)
| 19 |
is well defined. By assumption (a3.), f is -Lipschitz and hence is -Lipschitz. Consequently, is 1-Lipschitz for all and so is H. This will be used in the proof on several occasions. Let and , then
| 20 |
For define the function . Then for any ,
| 21 |
where holds since for all . The partial products in (19) can be written as
In view of the estimate (21), converges to for any where . Furthermore,
| 22 |
where we used the bound . For any and all the estimate (21) implies
and thus, in view of the bound (22), we obtain
| 23 |
Since 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
converges to G uniformly on compacts. Fix an , define and, for , let
and
Since all these functions are bounded by 1 and
Since is continuous and the convergence is uniform on compacts, it follows that
and hence, to complete the proof, we need to show that
| 24 |
To this end, in view of Corollary 5,
and hence
Consequently, for all ,
| 25 |
Here the bound holds since for both arguments of 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 where a is the constant guaranteed by Lemma 6. Moreover, for all such n
| 26 |
Moreover, the sequence of functions is decreasing on [0, R] for all n large enough:
where the inequality holds since is increasing near the origin. It follows now from Dini’s theorem that the convergence in (26) is uniform:
The convergence in (24) holds since both and are bounded by 1 and
Lemma 8
H has continuous second derivative
| 27 |
Proof
The partial products in (18)
satisfy
where the convention is used. By assumption (a3.), is bounded uniformly on a vicinity of the origin. is continuous by Lemma 7 and therefore is bounded on compacts. Hence the series is compactly convergent. By Lemma 7, so is . Thus converges compactly, its limit is continuous and coincides with .
The auxiliary Galton–Watson process
Let be an array of i.i.d. U([0, 1]) random variables and define
where is the offspring distribution function when the population density is x, cf. assumption (a1.). Then for all . Let . By assumption (a1.)
| 28 |
Let and be processes generated by the recursions
started from the same initial conditions . By construction these processes coincide in distribution with (1) and (8) respectively. Moreover, in view of (28), by induction
| 29 |
The approximation
In view of (11),
Since H has continuous derivative it follows that
Thus to prove the assertion of Theorem 2 it remains to show that
The process satisfies
By Taylor’s approximation and in view of Corollary 5
| 30 |
where
| 31 |
with satisfying
| 32 |
Since is assumed, f is -Lipschitz. By subtracting equation (5) from (30) we obtain the bound for :
| 33 |
subject to , where we defined
Consequently,
and it is left to show that the contribution of each term at time is of order as .
Contribution of the initial condition
Since and, by (18), , Taylor’s approximation implies that for all K large enough
and, consequently,
Contribution of
To estimate the residual, defined in (31), let us show first that the family of random variables
| 34 |
is bounded in probability as . By equation (32),
If is bounded then (34) is obviously bounded. Let us proceed assuming that is unbounded. Define By continuity, is finite, continuous and increases to . Let be its generalized inverse
Since is continuous and unbounded, is nondecreasing (not necessarily continuous) and as . Then for any , by the union bound,
This proves that (34) is bounded in probability. The contribution of in (33) can now be bounded as
where
Hence
Contribution of
By conditional independence of ’s
In view of (29), the sequence satisfies
where the last bound holds in view of (29) and the well known formula for the second moment of the Galton–Watson process. Since it follows that
Hence the contribution of in (33) is bounded by
Contribution of
By assumption (a2.),
where holds by (28). Hence contributes
Contribution of
The function is continuously differentiable with and thus Taylor’s approximation gives
where satisfies . Here
It follows that
It is then argued as in Sect. 3.3.2 that
Acknowledgements
The research was supported by ARC grant DP220100973.
Funding
Open access funding provided by Hebrew University of Jerusalem.
Footnotes
The usual notations for probabilistic orders is used throughout. In particular, for a sequence of random variables and a sequence of numbers as , the notation means that the sequence is bounded in probability.
[x] and denote the integer and fractional part of .
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- Athreya KB, Ney PE (1972) Branching processes. Die Grundlehren der mathematischen Wissenschaften, Band 196, p 287. Springer, New York
- 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]
- 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]
- 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]
- 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]
- 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
- 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]
- 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]
- 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]
- 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]
- 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]
- 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
- 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]
- 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]
- 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]
- 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]
- 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]
