SearcharxivSearch

arXiv · 0812.1655

Polymorphic evolution sequence and evolutionary branching

Abstract

We are interested in the study of models describing the evolution of a polymorphic population with mutation and selection in the specific scales of the biological framework of adaptive dynamics. The population size is assumed to be large and the mutation rate small. We prove that under a good combination of these two scales, the population process is approximated in the long time scale of mutations by a Markov pure jump process describing the successive trait equilibria of the population. This process, which generalizes the so-called trait substitution sequence, is called polymorphic evolution sequence. Then we introduce a scaling of the size of mutations and we study the polymorphic evolution sequence in the limit of small mutations. From this study in the neighborhood of evolutionary singularities, we obtain a full mathematical justification of a heuristic criterion for the phenomenon of evolutionary branching. To this end we finely analyze the asymptotic behavior of 3-dimensional competitive Lotka-Volterra systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Champagnat, Sylvie Méléard. 2008-12-09. Polymorphic evolution sequence and evolutionary branching. https://doi.org/10.1007/s00440-010-0292-9

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