Asymptotic number of caterpillars of regularly varying $\Lambda$-coalescents that come down from infinity
Bati Sengul

TL;DR
This paper investigates the asymptotic behavior of the number of r-caterpillars in $ ext{Lambda}$-coalescents that come down from infinity, establishing convergence results under regular variation assumptions.
Contribution
It provides the first explicit asymptotic characterization of the number of r-caterpillars in $ ext{Lambda}$-coalescents with regular variation, including convergence to a constant.
Findings
Number of r-caterpillars converges to an explicit constant as sample size increases
Results apply to $ ext{Lambda}$-coalescents that come down from infinity
Provides asymptotic formulas under regular variation assumptions
Abstract
In this paper we look at the asymptotic number of r-caterpillars for -coalescents which come down from infinity, under a regularly varying assumption. An r-caterpillar is a functional of the coalescent process started from 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 -caterpillars, suitably scaled, converge to an explicit constant as the sample size n goes to infinity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Mathematical Dynamics and Fractals · Markov Chains and Monte Carlo Methods
