SearcharxivSearch

arXiv · 1509.02022

Convergence of an infinite dimensional stochastic process to a spatially structured trait substitution sequence

Abstract

We consider an individual-based spatially structured population for Darwinian evolution in an asexual population. The individuals move randomly on a bounded continuous space according to a reflected brownian motion. The dynamics involves also a birth rate, a density-dependent logistic death rate and a probability of mutation at each birth event. We study the convergence of the microscopic process when the population size grows to $+\infty$ and the mutation probability decreases to $0$. We prove a convergence towards a jump process that jumps in the infinite dimensional space of the stable spatial distributions. The proof requires specific studies of the microscopic model. First, we examine the large deviation principle around the deterministic large population limit of the microscopic process. Then, we find a lower bound on the exit time of a neighborhood of a stationary spatial distribution. Finally, we study the extinction time of the branching diffusion processes that approximate small size populations.

Explore related subjects

Keep this discovery

BibTeXRIS

Helene Leman. 2015-09-07. Convergence of an infinite dimensional stochastic process to a spatially structured trait substitution sequence. https://arxiv.org/abs/1509.02022

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