Search arXivSearch

arXiv · 0809.3767

Stochastic and deterministic models for age-structured populations with genetically variable traits

Abstract

Understanding how stochastic and non-linear deterministic processes interact is a major challenge in population dynamics theory. After a short review, we introduce a stochastic individual-centered particle model to describe the evolution in continuous time of a population with (continuous) age and trait structures. The individuals reproduce asexually, age, interact and die. The 'trait' is an individual heritable property (d-dimensional vector) that may influence birth and death rates and interactions between individuals, and vary by mutation. In a large population limit, the random process converges to the solution of a Gurtin-McCamy type PDE. We show that the random model has a long time behavior that differs from its deterministic limit. However, the results on the limiting PDE and large deviation techniques \textit{à la} Freidlin-Wentzell provide estimates of the extinction time and a better understanding of the long time behavior of the stochastic process. This has applications to the theory of adaptive dynamics used in evolutionary biology. We present simulations for two biological problems involving life-history trait evolution when body size is plastic and individual growth is taken into account.

Explore related subjects

Keep this discovery

BibTeXRIS

Regis Ferriere, Viet Chi Tran. 2009-04-12. Stochastic and deterministic models for age-structured populations with genetically variable traits. https://doi.org/10.1051/proc/2009033

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