SearcharxivSearch

arXiv · 1305.3319

Splitting trees with neutral mutations at birth

Abstract

We consider a population model where individuals behave independently from each other and whose genealogy is described by a chronological tree called splitting tree. The individuals have i.i.d. (non-exponential) lifetime durations and give birth at constant rate to clonal or mutant children in an infinitely many alleles model with neutral mutations. First, to study the allelic partition of the population, we are interested in its frequency spectrum, which, at a fixed time, describes the number of alleles carried by a given number of individuals and with a given age. We compute the expected value of this spectrum and obtain some almost sure convergence results thanks to classical properties of Crump-Mode-Jagers (CMJ) processes counted by random characteristics. Then, by using multitype CMJ-processes, we get asymptotic properties about the number of alleles that have undergone a fixed number of mutations with respect to the ancestral allele of the population.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathieu Richard. 2014-05-17. Splitting trees with neutral mutations at birth. https://arxiv.org/abs/1305.3319

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