Tree lengths for general \(\Lambda \)-coalescents and the asymptotic site frequency spectrum around the Bolthausen-Sznitman coalescent (Q2286448): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1804.00961 / rank
 
Normal rank

Revision as of 03:22, 19 April 2024

scientific article
Language Label Description Also known as
English
Tree lengths for general \(\Lambda \)-coalescents and the asymptotic site frequency spectrum around the Bolthausen-Sznitman coalescent
scientific article

    Statements

    Tree lengths for general \(\Lambda \)-coalescents and the asymptotic site frequency spectrum around the Bolthausen-Sznitman coalescent (English)
    0 references
    22 January 2020
    0 references
    The authors investigate \(\Lambda\)-coalescents without dust component. The latter means that the driving measure \(\Lambda\) satisfies \(\int_{[0,1]}x^{-1}\Lambda(dx)=\infty\). The objects in focus are (a) the total length; (b) the total external length; (c) the total internal length; (d) the total length of all internal branches carrying a subtree with \(a\) leaves (\(a\geq 1\)) of the coalescent tree with \(n\) vertices at the last level. For the object (a), a strong law of large numbers, as \(n\to\infty\), is established. For the object (b), a weak law of large numbers, as \(n\to\infty\), is proved. For the objects (c,d), a strong law of large numbers, as \(n\to\infty\), is obtained under the additional assumption that the function \(y\mapsto \int_{(y,1]}x^{-2}\Lambda(dx)\) is regularly varying at \(0\) of index \(-1\). The assumption particularly ensures that the total internal branch length is of smaller order than the total external branch length. The strong law for the object (d) is used to provide the a.s. asymptotic behavior of components of the site frequency spectrum. The assertions of the present work unify several particular previously known results (these are explicitly mentioned in the paper). To prove their results, the authors work out a new argument which enables them to effectively treat some specific functionals of the decreasing block-counting discrete-time Markov chain. Also, they provide a thoughtful intuitive reasoning behind their findings.
    0 references
    \( \Lambda \)-coalescent
    0 references
    Bolthausen-Sznitman coalescent
    0 references
    law of large numbers
    0 references
    tree length
    0 references
    infinite sites model
    0 references
    sampling formula
    0 references
    site frequency spectrum
    0 references
    decreasing Markov chain
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references