SearcharxivSearch

arXiv · 1311.0649

Some large deviations in Kingman's coalescent

Abstract

Kingman's coalescent is a random tree that arises from classical population genetic models such as the Moran model. The individuals alive in these models correspond to the leaves in the tree and the following two laws of large numbers concerning the structure of the tree-top are well-known: (i) The (shortest) distance, denoted by $T_n$, from the tree-top to the level when there are $n$ lines in the tree satisfies $nT_n \xrightarrow{n\to\infty} 2$ almost surely; (ii) At time $T_n$, the population is naturally partitioned in exactly $n$ families where individuals belong to the same family if they have a common ancestor at time $T_n$ in the past. If $F_{i,n}$ denotes the size of the $i$th family, then $n(F_{1,n}^2 + \cdots + F_{n,n}^2) \xrightarrow{n\to \infty}2$ almost surely. For both laws of large numbers we prove corresponding large deviations results. For (i), the rate of the large deviations is $n$ and we can give the rate function explicitly. For (ii), the rate is $n$ for downwards deviations and $\sqrt n$ for upwards deviations. For both cases we give the exact rate function.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrej Depperschmidt, Peter Pfaffelhuber, Annika Scheuringer. 2014-06-22. Some large deviations in Kingman's coalescent. https://arxiv.org/abs/1311.0649

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