SearcharxivSearch

arXiv · 2512.24779

The tournament ratchet's clicktime process, and metastability in a Moran model

Abstract

Muller's ratchet, in its prototype version, models a haploid, asexual population whose size~$N$ is constant over the generations. Slightly deleterious mutations are acquired along the lineages at a constant rate, and individuals carrying less mutations have a selective advantage. In the classical variant, an individual's selective advantage is proportional to the difference between the population average and the individual's mutation load, whereas in the ratchet with {\em tournament selection} only the signs of the differences of the individual mutation loads matter. In a parameter regime which leads to slow clicking (i.e. to a loss of the currently fittest class at a rate $\ll 1/N$) we prove that the rescaled process of click times of the tournament ratchet converges as $N\to \infty$ to a Poisson process. Central ingredients in the proof are a thorough analysis of the metastable behaviour of a two-type Moran model with selection and deleterious mutation (which describes the size of the fittest class up to its extinction time) and a lower estimate on the size of the new fittest class at a clicktime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Lukas Igelbrink, Charline Smadi, Anton Wakolbinger. 2025-12-31. The tournament ratchet's clicktime process, and metastability in a Moran model. https://arxiv.org/abs/2512.24779

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