SearcharxivSearch

arXiv · 2009.09418

$\Lambda$-coalescents arising in populations with dormancy

Abstract

Consider a population evolving from year to year through three seasons: spring, summer and winter. Every spring starts with $N$ dormant individuals waking up independently of each other according to a given distribution. Once an individual is awake, it starts reproducing at a constant rate. By the end of spring, all individuals are awake and continue reproducing independently as Yule processes during the whole summer. In the winter, $N$ individuals chosen uniformly at random go to sleep until the next spring, and the other individuals die. We show that because an individual that wakes up unusually early can have a large number of surviving descendants, for some choices of model parameters the genealogy of the population will be described by a $\Lambda$-coalescent. In particular, the beta coalescent can describe the genealogy when the rate at which individuals wake up increases exponentially over time. We also characterize the set of all $\Lambda$-coalescents that can arise in this framework.

Explore related subjects

Keep this discovery

BibTeXRIS

Fernando Cordero, Adrián González Casanova, Jason Schweinsberg, Maite Wilke-Berenguer. 2020-09-20. $\Lambda$-coalescents arising in populations with dormancy. https://arxiv.org/abs/2009.09418

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