English
Related papers

Related papers: The total external branch length of Beta-coalescen…

200 papers

We consider Beta$(2-\alpha, \alpha)$-coalescents with parameter range $1 <\alpha<2$ starting from $n$ leaves. The length $\ell^{(n)}_r$ of order $r$ in the $n$-Beta$(2-\alpha, \alpha)$-coalescent tree is defined as the sum of the lengths of…

Probability · Mathematics 2022-11-30 Matthias Birkner , Iulia Dahmer , Christina S. Diehl , Götz Kersting

In this paper, we consider Beta$(2-{\alpha},{\alpha})$ (with $1<{\alpha}<2$) and related ${\Lambda}$-coalescents. If $T^{(n)}$ denotes the length of an external branch of the $n$-coalescent, we prove the convergence of…

Probability · Mathematics 2012-01-20 Jean-Stephane Dhersin , Fabian Freund , Arno Siri-Jegousse , Linglong Yuan

We derive the asymptotic distribution of the total length $L_n$ of a $\operatorname {Beta}(2-\alpha,\alpha)$-coalescent tree for $1<\alpha<2$, starting from $n$ individuals. There are two regimes: If $\alpha\le1/2(1+\sqrt{5})$, then $L_n$…

Probability · Mathematics 2012-10-22 Götz Kersting

We consider a ${\Lambda}$-coalescent and we study the asymptotic behavior of the total length $L^{(n)}_{ext}$ of the external branches of the associated $n$-coalescent. For Kingman coalescent, i.e. ${\Lambda}={\delta}_0$, the result is well…

Probability · Mathematics 2013-05-24 Jean-Stephane Dhersin , Linglong Yuan

$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…

Probability · Mathematics 2019-09-12 Christina S. Diehl , Götz Kersting

We present approximation methods which lead to law of large numbers and fluctuation results for functionals of $\Lambda$-coalescents, both in the dust-free case and in the case with a dust component. Our focus is on the tree length (or…

Probability · Mathematics 2021-07-15 Götz Kersting , Anton Wakolbinger

We give the asymptotic distribution of the length of partial coalescent trees for Beta and related coalescents. This allows us to give the asymptotic distribution of the number of (neutral) mutations in the partial tree. This is a first…

Probability · Mathematics 2007-06-04 Jean-François Delmas , Jean-Stéphane Dhersin , Arno Siri-Jegousse

In the Kingman coalescent tree the length of order $r$ is defined as the sum of the lengths of all branches that support $r$ leaves. For $r=1$ these branches are external, while for $r\ge2$ they are internal and carry a subtree with $r$…

Probability · Mathematics 2015-05-29 Iulia Dahmer , Götz Kersting

In mathematical population genetics, it is well known that one can represent the genealogy of a population by a tree, which indicates how the ancestral lines of individuals in the population coalesce as they are traced back in time. As the…

Probability · Mathematics 2014-02-20 Götz Kersting , Jason Schweinsberg , Anton Wakolbinger

This article shows the asymptotics of distributions of various functionals of the Beta$(2-\alpha,\alpha)$ $n$-coalescent process with $1<\alpha<2$ when $n$ goes to infinity. This process is a Markov process taking {values} in the set of…

Probability · Mathematics 2014-03-27 Arno Siri-Jégousse , Linglong Yuan

Representation of coalescent process using pruning of trees has been used by Goldschmidt and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the $\beta(3/2,1/2)$-coalescent. By considering a pruning procedure on…

Probability · Mathematics 2015-01-08 Romain Abraham , Jean-Francois Delmas

Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $\beta(3/2,1/2)$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning…

Probability · Mathematics 2013-09-11 Romain Abraham , Jean-François Delmas

We study tree lengths in $\Lambda$-coalescents without a dust component from a sample of $n$ individuals. For the total length of all branches and the total length of all external branches we present laws of large numbers in full…

Probability · Mathematics 2019-01-23 Christina S. Diehl , Götz Kersting

We derive the asymptotic behavior of the total, active and inactive branch lengths of the seed bank coalescent, when the size of the initial sample grows to infinity. Those random variables have important applications for populations…

Probability · Mathematics 2020-09-28 Adrián González Casanova , Lizbeth Peñaloza , Arno Siri-Jégousse

For a finite measure $\varLambda$ on $[0,1]$, the $\varLambda$-coalescent is a coalescent process such that, whenever there are $b$ clusters, each $k$-tuple of clusters merges into one at rate…

Probability · Mathematics 2009-09-29 Julien Berestycki , Nathanaël Berestycki , Jason Schweinsberg

Leaves of vascular plants are arranged regularly around stems, a phenomenon known as phyllotaxis. A constant angle between two successive leaves is called divergence angle. On the one side, the divergence angle $\alpha_0$ of an initial…

Biological Physics · Physics 2017-07-19 Takuya Okabe

We study the number of collisions $X_n$ of an exchangeable coalescent with multiple collisions ($\Lambda$-coalescent) which starts with $n$ particles and is driven by rates determined by a finite characteristic measure $\nu({\rm…

Probability · Mathematics 2008-07-18 Alexander Gnedin , Alex Iksanov , Martin Möhle

We study a class of coalescents derived from a sampling procedure out of N i.i.d. Pareto(alpha) random variables, normalized by their sum, including beta-size-biasing on total length effects (beta < alpha). Depending on the range of alpha,…

Probability · Mathematics 2013-02-26 Thierry Huillet

In the critical beta-splitting model of a random $n$-leaf binary tree, leaf-sets are recursively split into subsets, and a set of $m$ leaves is split into subsets containing $i$ and $m-i$ leaves with probabilities proportional to…

Probability · Mathematics 2024-09-09 David Aldous , Boris Pittel

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…

Probability · Mathematics 2024-12-18 David Aldous , Svante Janson
‹ Prev 1 2 3 10 Next ›