SearcharxivSearch

arXiv · 1709.02563

Coalescent results for diploid exchangeable population models

Abstract

We consider diploid bi-parental analogues of Cannings models: in a population of fixed size $N$ the next generation is composed of $V_{i,j}$ offspring from parents $i$ and $j$, where $V=(V_{i,j})_{1\le i\neq j \le N}$ is a (jointly) exchangeable (symmetric) array. Every individual carries two chromosome copies, each of which is inherited from one of its parents. We obtain general conditions, formulated in terms of the vector of the total number of offspring to each individual, for the convergence of the properly scaled ancestral process for an $n$-sample of genes towards a ($\Xi$-)coalescent. This complements M\"ohle and Sagitov's (2001) result for the haploid case and sharpens the profile of M\"ohle and Sagitov's (2003) study of the diploid case, which focused on fixed couples, where each row of $V$ has at most one non-zero entry. We apply the convergence result to several examples, in particular to two diploid variations of Schweinsberg's (2003) model, leading to Beta-coalescents with two-fold and with four-fold mergers, respectively.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthias Birkner, Huili Liu, Anja Sturm. 2017-09-08. Coalescent results for diploid exchangeable population models. https://arxiv.org/abs/1709.02563

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