SearcharxivSearch

arXiv · 2211.13109

Quasi-equilibria and click times for a variant of Muller's ratchet

Abstract

Consider a population of $N$ individuals, each of them carrying a type in $\mathbb N_0$. The population evolves according to a Moran dynamics with selection and mutation, where an individual of type $k$ has the same selective advantage over all individuals with type $k' > k$, and type $k$ mutates to type $k+1$ at a constant rate. This model is thus a variation of the classical Muller's ratchet: there the selective advantage is proportional to $k'-k$. For a regime of selection strength and mutation rates which is between the regimes of weak and strong selection/mutation, we obtain the asymptotic rate of the {\em click times} of the ratchet (i.e. the times at which the hitherto minimal (`best') type in the population is lost), and reveal the quasi-stationary type frequency profile between clicks. The large population limit of this profile is characterized as the normalized attractor of a ``dual'' hierarchical multitype logistic system, and also via the distribution of the final minimal displacement in a branching random walk with one-sided steps. An important role in the proofs is played by a graphical representation of the model, both forward and backward in time, and a central tool is the ancestral selection graph decorated by mutations.

Explore related subjects

Keep this discovery

BibTeXRIS

Adrian Gonzalez Casanova, Charline Smadi, Anton Wakolbinger. 2022-11-23. Quasi-equilibria and click times for a variant of Muller's ratchet. https://doi.org/10.1214/23-ejp1055

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