Search arXivSearch

arXiv · 2107.10794

Uniform in time propagation of chaos for a Moran model

Abstract

The goal of this article is to study the limit of the empirical distribution induced by a mutation-selection multi-allelic Moran model, whose dynamic is given by a continuous-time irreducible Markov chain. The rate matrix driving the mutation is assumed irreducible and the selection rates are assumed uniformly bounded. The paper is divided into two parts. The first one deals with processes with general selection rates. For this case we are able to prove the propagation of chaos in $\mathbb{L}^p$ over the compacts, with speed of convergence of order $1/\sqrt{N}$. Further on, we consider a specific type of selection that we call additive selection. Essentially, we assume that the selection rate can be decomposed as the sum of three terms: a term depending on the allelic type of the parent (which can be understood as selection at death), another term depending on the allelic type of the descendant (which can be understood as selection at birth) and a third term which is symmetric. Under this setting, our results include a uniform in time bound for the propagation on chaos in $\mathbb{L}^p$ of order $1/\sqrt{N}$, and the proof of the asymptotic normality with zero mean and explicit variance, for the approximation error between the empirical distribution and its limit, when the number of individuals tend towards infinity. Additionally, we explore the interpretation of the Moran model with additive selection as a particle process whose empirical distribution approximates a quasi-stationary distribution, in the same spirit as the Fleming\,--\,Viot particle systems. We then address the problem of minimising the asymptotic quadratic error, when the time and the number of particles go to infinity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bertrand Cloez, Josué Corujo. 2022-09-27. Uniform in time propagation of chaos for a Moran model. https://doi.org/10.1016/j.spa.2022.09.006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Villani's conjecture for Kac's walk

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every $N\geq2$, with total collision rate $N$, the optimal entropy production constant is $2/(N-1)$. We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With $N$ fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

math.PR

Scaling limit and tail bounds for a random walk model of SOS level lines

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D solid-on-solid (SOS) model, where the emergence of these level lines has been rigorously established. The model we consider is a line ensemble of non-crossing random walk bridges above a wall with geometrically growing area tilts. Our main result, which in particular resolves a question of Caputo, Ioffe, and Wachtel (2019), is an edge 1:2:3 scaling limit for this ensemble as the domain size diverges, with a growing number of walks (including the number of level lines of the SOS model) and high boundary conditions (covering the maximum upper deviation of the SOS level lines). As a key input, we establish Tracy--Widom-type upper tail bounds for each of the relevant curves in the line ensemble. An ingredient which may be of independent interest is a ballot theorem for random walk bridges under a broader range of boundary values than available in the literature.

math.PR

One-dimensional particle clouds with elastic collisions

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it tries to jump left, the jump is executed. If not, 'momentum' is transferred to increase the rate of jumping left of the minimal-label particle. Similarly for jumps to the right. The collision rule is 'elastic' in the sense that the net rate of flow of mass is independent of the present configuration, in contrast to the exclusion process, for example. We show that the particle masses and jump rates determine explicitly, via a concave majorant of a simple `potential' function associated to the masses and jump rates, a unique partition of the system into maximal stable subsystems. The internal configuration of each stable subsystem remains tight, while the location of each stable subsystem obeys a strong law of large numbers with an explicit speed. We indicate connections to adjacent models, including diffusions with rank-based coefficients, where, to the authors' knowledge, the problem of identifying the analogous decomposition into stable sub-systems is yet to be fully solved.

math.PR