SearcharxivSearch

arXiv · 1903.10161

Two level natural selection with a quasi-stationarity approach

Abstract

In a view for a simple model where natural selection at the individual level is confronted to selection effects at the group level, we consider some individual-based models of some large population subdivided into a large number of groups. We then obtain the convergence to the law of a stochastic process with some Feynman-Kac penalization. To analyze the limiting behavior of this law, we exploit a recent approach, designed for the convergence to quasi-stationary distributions. We are able to deal with the fixation of the stochastic process and relate the convergence to equilibrium to the one where fixation implies extinction. We notably establish different regimes of convergence. Besides the case of an exponential rate (the rate being uniform over the initial condition), critical regimes with convergence in 1/t are also to notice. We finally address the relevance of such limiting behaviors to predict the long-time behavior of the individual-based model and describe more specifically the cases of weak selection. Consequences in term of evolutive dynamics are also derived, where such competition is assumed to occur repeatedly at each de novo mutation.

Explore related subjects

Keep this discovery

BibTeXRIS

Aurélien Velleret. 2019-03-25. Two level natural selection with a quasi-stationarity approach. https://doi.org/10.3934/dcdsb.2023122

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