2000 character limit reached
Asymptotic number of caterpillars of regularly varying $Λ$-coalescents that come down from infinity
Published 6 Dec 2016 in math.PR | (1612.01902v1)
Abstract: In this paper we look at the asymptotic number of r-caterpillars for $\Lambda$-coalescents which come down from infinity, under a regularly varying assumption. An r-caterpillar is a functional of the coalescent process started from $n$ individuals which, roughly speaking, is a block of the coalescent at some time, formed by one line of descend to which r-1 singletons have merged one by one. We show that the number of $r$-caterpillars, suitably scaled, converge to an explicit constant as the sample size n goes to infinity.
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.