SearcharxivSearch

arXiv · 2306.03512

The mutation process on the ancestral line under selection

Abstract

We consider the Moran model of population genetics with two types, mutation, and selection, and investigate the line of descent of a randomly-sampled individual from a contemporary population. We trace this ancestral line back into the distant past, far beyond the most recent common ancestor of the population (thus connecting population genetics to phylogeny), and analyse the mutation process along this line. To this end, we use the pruned lookdown ancestral selection graph, which consists of a set of potential ancestors of the sampled individual at any given time. Relative to the neutral case (that is, without selection), we obtain a general bias towards the beneficial type, an increase in the beneficial mutation rate, and a decrease in the deleterious mutation rate. This sheds new light on previous analytical results. We discuss our findings in the light of a well-known observation at the interface of phylogeny and population genetics, namely, the difference in the mutation rates (or, more precisely, mutation fluxes) estimated via phylogenetic methods relative to those observed in pedigree studies.

Explore related subjects

Keep this discovery

BibTeXRIS

Ellen Baake, Enrico Di Gaspero, Fernando Cordero. 2023-06-06. The mutation process on the ancestral line under selection. https://doi.org/10.1016/j.tpb.2024.04.004

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