SearcharxivSearch

arXiv · 2503.13154

Evolution of a trait distributed over a large fragmented population: Propagation of chaos meets adaptive dynamics

Abstract

We consider a metapopulation made up of $K$ demes, each containing $N$ individuals bearing a heritable quantitative trait. Demes are connected by migration and undergo independent Moran processes with mutation and selection based on trait values. Mutation and migration rates are tuned so that each deme receives a migrant or a mutant in the same slow timescale and is thus essentially monomorphic at all times for the trait (adaptive dynamics). In the timescale of mutation/migration, the metapopulation can then be seen as a giant spatial Moran model with size $K$ that we characterize. As $K\to \infty$ and physical space becomes continuous, the empirical distribution of the trait (over the physical and trait spaces) evolves deterministically according to an integro-differential evolution equation. In this limit, the trait of every migrant is drawn from this global distribution, so that conditional on its initial state, traits from finitely many demes evolve independently (propagation of chaos). Under mean-field dispersal, the value $X_t$ of the trait at time $t$ and at any given location has a law denoted $\mu_t$ and a jump kernel with two terms: a mutation-fixation term and a migration-fixation term involving $\mu_{t-}$ (McKean-Vlasov equation). In the limit where mutations have small effects and migration is further slowed down accordingly, we obtain the convergence of $X$, in the new migration timescale, to the solution of a stochastic differential equation which can be referred to as a new canonical equation of adaptive dynamics. This equation includes an advection term representing selection, a diffusive term due to genetic drift, and a jump term, representing the effect of migration, to a state distributed according to its own law.

Explore related subjects

Keep this discovery

BibTeXRIS

Amaury Lambert, Hélène Leman, Hélène Morlon, Josué Tchouanti. 2025-03-17. Evolution of a trait distributed over a large fragmented population: Propagation of chaos meets adaptive dynamics. https://arxiv.org/abs/2503.13154

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