SearcharxivSearch

arXiv · 1902.02155

Cannings models, population size changes and multiple-merger coalescents

Abstract

Multiple-merger coalescents, e.g. $\Lambda$-$n$-coalescents, have been proposed as models of the genealogy of $n$ sampled individuals for a range of populations whose genealogical structures are not captured well by Kingman's $n$-coalescent. $\Lambda$-$n$-coalescents can be seen as the limit process of the discrete genealogies of Cannings models with fixed population size, when time is rescaled and population size $N\to\infty$. As established for Kingman's $n$-coalescent, moderate population size fluctuations in the discrete population model should be reflected by a time-change of the limit coalescent. For $\Lambda$-$n$-coalescents, this has been explicitly shown for only a limited subclass of $\Lambda$-$n$-coalescents and exponentially growing populations. This article gives a general construction of time-changed $\Lambda$-$n$-coalescents as limits of specific Cannings models with rather arbitrary time changes.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabian Freund. 2019-02-06. Cannings models, population size changes and multiple-merger coalescents. https://doi.org/10.1007/s00285-020-01470

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