arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.6512math.PR
收藏

λ-聚结子的渐近抽样公式

Asymptotic sampling formulae for Lambda-coalescents

Julien Berestycki, Nathanael Berestycki, Vlada Limic

摘要:

我们提出了一个强大的方法,将信息的速度从无穷远的家谱树到抽样公式的基础人口。我们将这些结果应用到人口动态的家谱是由一个λ-coalescent。这使我们能够推导出一个精确的公式的渐近行为的网站和等位基因的频谱和隔离网站的数量,因为样本量趋于无穷大。我们的一些结果举行的情况下,一般的λ-聚结,从无穷大,但我们得到更精确的信息下,一个经常变化的假设。在这种情况下,我们得到的结果,独立的兴趣的时间,在该时间均匀随机选择的突变产生。这在α=3/2处表现出相变,其中α \in(1,2)是规则变化的指数。

英文摘要:

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 α=3/2, where α\in(1,2) is the exponent of regular variation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑