SearcharxivSearch

arXiv · 1304.4640

Trait substitution trees on two time scales analysis

Abstract

In this paper we consider two continuous-mass population models as analogues of logistic branching random walks, one is supported on a finite trait space and the other one is supported on an infinite trait space. For the first model with nearest-neighbor competition and migration, we justify a well-described evolutionary path to the short-term equilibrium on a slow migration time scale. For the second one with an additional evolutionary mechanism-mutation, a jump process-trait substitution tree model is established under a combination of rare mutation and slow migration limits. The transition rule of the tree highly depends on the relabelled trait sequence determined by the fitness landscape. The novelty of our model is that each trait, which may nearly die out on the migration time scale, has a chance to recover and further to be stabilized on the mutation time scale because of a change in the fitness landscape due to a newly entering mutant.

Explore related subjects

Keep this discovery

BibTeXRIS

Anton Bovier, Shi-Dong Wang. 2013-04-16. Trait substitution trees on two time scales analysis. https://arxiv.org/abs/1304.4640

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