SearcharxivSearch

arXiv · 2004.14332

Populations in environments with a soft carrying capacity are eventually extinct

Abstract

Consider a population whose size changes stepwise by its members reproducing or dying (disappearing), but is otherwise quite general. Denote the initial (non-random) size by $Z_0$ and the size of the $n$th change by $C_n$, $n= 1, 2, \ldots$. Population sizes hence develop successively as $Z_1=Z_0+C_1,\ Z_2=Z_1+C_2$ and so on, indefinitely or until there are no further size changes, due to extinction. Extinction is thus assumed final, so that $Z_n=0$ implies that $Z_{n+1}=0$, without there being any other finite absorbing class of population sizes. We make no assumptions about the time durations between the successive changes. In the real world, or more specific models, those may be of varying length, depending upon individual life span distributions and their interdependencies, the age-distribution at hand and intervening circumstances. Changes may have quite varying distributions. The basic assumption is that there is a {\em carrying capacity}, i.e. a non-negative number $K$ such that the conditional expectation of the change, given the complete past history, is non-positive whenever the population exceeds the carrying capacity. Further, to avoid unnecessary technicalities, we assume that the change $C_n$ equals -1 (one individual dying) with a conditional (given the past) probability uniformly bounded away from 0. It is a simple and not very restrictive way to avoid parity phenomena, it is related to irreducibility in Markov settings. The straightforward, but in contents and implications far-reaching, consequence is that all such populations must die out. Mathematically, it follows by a submartingale convergence property and positive probability of reaching the absorbing extinction state.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Jagers, Sergei Zuyev. 2020-04-29. Populations in environments with a soft carrying capacity are eventually extinct. https://arxiv.org/abs/2004.14332

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR