SearcharxivSearch

arXiv · 1902.07976

On the establishment of a mutant

Abstract

How long does it take for an initially advantageous mutant to establish itself in a resident population, and what does the population composition look like then? We approach these questions in the framework of the so called Bare Bones evolution model Klebaner et al (2011) that provides a simplified approach to the adaptive population dynamics of binary splitting cells. As the mutant population grows, cell division becomes less probable, and it may in fact turn less likely than that of residents. Our analysis rests on the assumption of the process starting from resident population, with sizes proportional to a large carrying capacity $K$. Actually, we assume carrying capacities to be $a_1K$ and $a_2K$ for the resident and the mutant populations, respectively, and study the dynamics for $K\to\infty$. We find conditions for the mutant to be successful in establishing itself alongside the resident. The time it takes turns out to be proportional to $\log K$. We introduce the time of establishment through the asymptotic behavior of the stochastic nonlinear dynamics describing the evolution, and show that it is indeed $\log K/\log \rho$, where $\rho>1$ is twice the probability of successful division of the mutant at its appearance. Looking at the composition of the population, at times $\log K/\log \rho +n, n \in \mathbb{Z}_+$, we find that the densities (i.e. sizes relative to carrying capacities) of both populations follow closely the corresponding two dimensional nonlinear deterministic dynamics that starts at {\it a random point}. We characterise this random initial condition in terms of the scaling limit of the corresponding dynamics, and the limit of the properly scaled initial binary splitting process of the mutant. The deterministic approximation with random initial condition is in fact valid asymptotically at all times $\log K/\log \rho +n$ with $n\in \mathbb{Z}$.

Explore related subjects

Keep this discovery

BibTeXRIS

J. Baker, P. Chigansky, P. Jagers, F. Klebaner. 2019-02-21. On the establishment of a mutant. https://doi.org/10.1007/s00285-020-01478-x

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