2000 character limit reached
On the length of an external branch in the Beta-coalescent
Published 19 Jan 2012 in math.PR and q-bio.PE | (1201.3983v1)
Abstract: 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 $n{{\alpha}-1}T{(n)}$ when $n$ tends to $ \infty $, and give the limit. To this aim, we give asymptotics for the number $\sigma{(n)}$ of collisions which occur in the $n$-coalescent until the end of the chosen external branch, and for the block counting process associated with the $n$-coalescent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.