SearcharxivSearch

arXiv · 2209.13438

Asymptotics of the frequency spectrum for general Dirichlet Xi-coalescents

Abstract

In this work, we study general Dirichlet coalescents, which are a family of Xi-coalecents constructed from i.i.d mass partitions, and are an extension of the symmetric coalescent. This class of models is motivated by population models with recurrent demographic bottlenecks. We study the short time behavior of the multidimensional block counting process whose i-th component counts the number of blocks of size i. Compared to standard coalescent models (such as the class of Lambda-coalescents coming down from infinity), our process has no deterministic speed of coming down from infinity. In particular, we prove that, under appropriate re-scaling, it converges to a stochastic process which is the unique solution of a martingale problem. We show that the multivariate Lamperti transform of this limiting process is a Markov Additive Process (MAP). This allows us to provide some asymptotics for the n-Site Frequency Spectrum, which is a statistic widely used in population genetics. In particular, the rescaled number of mutations converges to the exponential functional of a subordinator.

Explore related subjects

Keep this discovery

BibTeXRIS

Adrian Gonzalez Casanova, Veronica Miro Pina, Emmanuel Schertzer, Arno Siri-Jegousse. 2022-09-27. Asymptotics of the frequency spectrum for general Dirichlet Xi-coalescents. https://arxiv.org/abs/2209.13438

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