SearcharxivSearch

arXiv · math/0511743

The process of most recent common ancestors in an evolving coalescent

Abstract

Consider a haploid population which has evolved through an exchangeable reproduction dynamics, and in which all individuals alive at time $t$ have a most recent common ancestor (MRCA) who lived at time $A_t$, say. As time goes on, not only the population but also its genealogy evolves: some families will get lost from the population and eventually a new MRCA will be established. For a time-stationary situation and in the limit of infinite population size $N$ with time measured in $N$ generations, i.e. in the scaling of population genetics which leads to Fisher-Wright diffusions and Kingman's coalescent, we study the process $\mathcal A = (A_t)$ whose jumps form the point process of time pairs $(E,B)$ when new MRCAs are established and when they lived. By representing these pairs as the entrance and exit time of particles whose trajectories are embedded in the look-down graph of Donnelly and Kurtz (1999) we can show by exchangeability arguments that the times $E$ as well as the times $B$ from a Poisson process. Furthermore, the particle representation helps to compute various features of the MRCA process, such as the distribution of the coalescent at the instant when a new MRCA is established, and the distribution of the number of MRCAs to come that live in today's past.

Explore related subjects

Keep this discovery

BibTeXRIS

P. Pfaffelhuber, A. Wakolbinger. 2006-04-17. The process of most recent common ancestors in an evolving coalescent. https://arxiv.org/abs/math/0511743

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