Second-order asymptotics for the block counting process in a class of regularly varying $\Lambda$-coalescents
Vlada Limic, Anna Talarczyk

TL;DR
This paper investigates the second-order asymptotics of the block counting process in certain $ ext{Lambda}$-coalescents, revealing convergence to a stable process and providing new insights into their small-time behavior.
Contribution
It introduces the first second-order asymptotic analysis for the block counting process in $ ext{Lambda}$-coalescents with regularly varying measures, extending understanding beyond first-order approximations.
Findings
The process converges to a totally skewed $(1+eta)$-stable process.
The limit process solves a stochastic differential equation of Ornstein-Uhlenbeck type.
Results apply to $ ext{Lambda}$-coalescents with measures having density near zero proportional to $x^{-eta}$.
Abstract
Consider a standard -coalescent that comes down from infinity. Such a coalescent starts from a configuration consisting of infinitely many blocks at time , but its number of blocks is a finite random variable at each positive time . Berestycki et al. [Ann. Probab. 38 (2010) 207-233] found the first-order approximation for the process at small times. This is a deterministic function satisfying as . The present paper reports on the first progress in the study of the second-order asymptotics for at small times. We show that, if the driving measure has a density near zero which behaves as with , then the process converges in law as in the Skorokhod space to a totally skewed -stable process.…
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.
