SearcharxivSearch

arXiv · 2407.00793

From clonal interference to Poissonian interacting trajectories

Abstract

We consider a population whose size $N$ is fixed over the generations, and in which random beneficial mutations arrive at a rate of order $1/\log N$ per generation. In this so-called Gerrish--Lenski regime, typically a finite number of contending mutations are present together with one resident type. These mutations compete for fixation, a phenomenon addressed as clonal interference. We introduce and study a Poissonian system of interacting trajectories (PIT), and prove that it arises as a large population scaling limit of the logarithmic sizes of the contending clonal subpopulations in a continuous-time Moran model with strong selection. We show that the PIT exhibits an almost surely positive asymptotic rate of fitness increase (speed of adaptation), which turns out to be finite if and only if fitness increments have a finite expectation. We relate this speed to heuristic predictions from the literature. Furthermore, we derive a functional central limit theorem for the fitness of the resident population in the PIT.

Explore related subjects

Keep this discovery

BibTeXRIS

Felix Hermann, Adrián Gonzalez Casanova, Renato Soares dos Santos, András Tóbiás, Anton Wakolbinger. 2024-06-30. From clonal interference to Poissonian interacting trajectories. https://arxiv.org/abs/2407.00793

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