Asymptotic sampling formulae for Lambda-coalescents

Details Asymptotic sampling formulae for Lambda-coalescents Asymptotic sampling formulae for Lambda-coalescents

2012-01-31

arxiv.org/abs/1201.6512v1

Mathematics

Probability

The results reported here were contained in the first version of arXiv:1101.1875. arXiv admin note: substantial text overlap w

Scientific paper

We present a robust method which translates information on the speed of coming down from infinity of a genealogical tree into sampling formulae for the underlying population. We apply these results to population dynamics where the genealogy is given by a Lambda-coalescent. This allows us to derive an exact formula for the asymptotic behavior of the site and allele frequency spectrum and the number of segregating sites, as the sample size tends to infinity. Some of our results hold in the case of a general Lambda-coalescent that comes down from infinity, but we obtain more precise information under a regular variation assumption. In this case, we obtain results of independent interest for the time at which a mutation uniformly chosen at random was generated. This exhibits a phase transition at \alpha=3/2, where \alpha \in(1,2) is the exponent of regular variation.

Affiliated with

Also associated with

No associations

Rating

Asymptotic sampling formulae for Lambda-coalescents does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic sampling formulae for Lambda-coalescents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic sampling formulae for Lambda-coalescents will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56817