SearcharxivSearch

arXiv · 1412.6635

The total external length of the evolving Kingman coalescent

Abstract

The evolving Kingman coalescent is the tree-valued process which records the time evolution undergone by the genealogies of Moran populations. We consider the associated process of total external tree length of the evolving Kingman coalescent and its asymptotic behaviour when the number of leaves of the tree tends to infinity. We show that on the time-scale of the Moran model slowed down by a factor equal to the population size, the (centred and rescaled) external length process converges to a stationary Gaussian process with almost surely continuous paths and covariance function $c(s,t)=\Big( \frac 2 {2+|s-t|} \Big)^2$. A key role in the evolution of the external length is played by the internal lengths of finite orders in the coalescent at a fixed time which behave asymptotically in a multivariate Gaussian manner (see Dahmer and Kersting (2015)). A coupling of the Moran model with a critical branching process is used. We also derive a central limit result for normally distributed sums endowed with independent random coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Iulia Dahmer, Götz Kersting. 2014-12-20. The total external length of the evolving Kingman coalescent. https://arxiv.org/abs/1412.6635

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