SearcharxivSearch

arXiv · 1108.4812

Splitting trees with neutral Poissonian mutations II: Largest and Oldest families

Abstract

We consider a supercritical branching population, where individuals have i.i.d. lifetime durations (which are not necessarily exponentially distributed) and give birth (singly) at constant rate. We assume that individuals independently experience neutral mutations, at constant rate $θ$ during their lifetimes, under the infinite-alleles assumption: each mutation instantaneously confers a brand new type, called allele or haplotype, to its carrier. The type carried by a mother at the time when she gives birth is transmitted to the newborn. We are interested in the sizes and ages at time $t$ of the clonal families carrying the most abundant alleles or the oldest ones, as $t\to\infty$, on the survival event. Intuitively, the results must depend on how the mutation rate $θ$ and the Malthusian parameter $α>0$ compare. Hereafter, $N\equiv N_t$ is the population size at time $t$, constants $a,c$ are scaling constants, whereas $k,k'$ are explicit positive constants which depend on the parameters of the model. When $α>θ$, the most abundant families are also the oldest ones, they have size $cN^{1-θ/α}$ and age $t-a$. When $α<θ$, the oldest families have age $(α/θ)t+a$ and tight sizes; the most abundant families have sizes $k\log(N)-k'\log\log(N)+c$ and all have age $(θ-α)^{-1}\log(t)$. When $α=θ$, the oldest families have age $kt-k'\log(t)+a$ and tight sizes; the most abundant families have sizes $(k\log(N)-k'\log\log(N)+c)^2$ and all have age $t/2$. Those informal results can be stated rigorously in expectation. Relying heavily on the theory of coalescent point processes, we are also able, when $α\leqθ$, to show convergence in distribution of the joint, properly scaled ages and sizes of the most abundant/oldest families and to specify the limits as some explicit Cox processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Champagnat, Amaury Lambert. 2011-08-24. Splitting trees with neutral Poissonian mutations II: Largest and Oldest families. https://doi.org/10.1016/j.spa.2012.11.013

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