SearcharxivSearch

arXiv · 2302.02960

Universality classes for the coalescent structure of heavy-tailed Galton-Watson trees

Abstract

Consider a population evolving as a critical continuous-time Galton-Watson (GW) tree. Conditional on the population surviving until a large time $T$, sample $k$ individuals uniformly at random (without replacement) from amongst those alive at time $T$. What is the genealogy of this sample of individuals? In cases where the offspring distribution has finite variance, the probabilistic properties of the joint ancestry of these $k$ particles are well understood, as seen in \cite{HJR20, J19}. In the present article, we study the joint ancestry of a sample of $k$ particles under the following regime: the offspring distribution has mean $1$ (critical) and the tails of the offspring distribution are \emph{heavy} in that $\alpha \in (1,2]$ is the supremum over indices $\beta$ such that the $\beta^{\text{th}}$ moment is finite. We show that for each $\alpha$, after rescaling time by $1/T$, there is a universal stochastic process describing the joint coalescent structure of the $k$ distinct particles. The special case $\alpha = 2$ generalises the known case of sampling from critical GW trees with finite variance where only pairwise mergers are observed and the genealogical tree is, roughly speaking, some kind of mixture of time-changed Kingman coalescents. The cases $\alpha \in (1,2)$ introduce new universal limiting partition-valued stochastic processes with interesting probabilistic structures which have representations connected to the Lauricella function and the Dirichlet distribution, and whose coalescent structures exhibit multiple-mergers of family lines. Moreover, in the case $\alpha \in (1,2)$, we show that the coalescent events of the ancestry of the $k$ particles are associated with birth events that produce giant numbers of offspring of the same order of magnitude as the entire population size, and we compute the joint law of the ancestry together with the sizes of these giant births.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon C. Harris, Samuel G. G. Johnston, Juan Carlos Pardo. 2023-02-06. Universality classes for the coalescent structure of heavy-tailed Galton-Watson trees. https://arxiv.org/abs/2302.02960

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