Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 60 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 14 tok/s Pro
GPT-4o 77 tok/s Pro
Kimi K2 159 tok/s Pro
GPT OSS 120B 456 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Second-order asymptotics for the block counting process in a class of regularly varying $Λ$-coalescents (1304.5183v3)

Published 18 Apr 2013 in math.PR

Abstract: Consider a standard ${\Lambda }$-coalescent that comes down from infinity. Such a coalescent starts from a configuration consisting of infinitely many blocks at time $0$, but its number of blocks $N_t$ is a finite random variable at each positive time $t$. Berestycki et al. [Ann. Probab. 38 (2010) 207-233] found the first-order approximation $v$ for the process $N$ at small times. This is a deterministic function satisfying $N_t/v_t\to1$ as $t\to0$. The present paper reports on the first progress in the study of the second-order asymptotics for $N$ at small times. We show that, if the driving measure $\Lambda$ has a density near zero which behaves as $x{-\beta}$ with $\beta\in(0,1)$, then the process $(\varepsilon{-1/(1+\beta)}(N_{\varepsilon t}/v_{\varepsilon t}-1))_{t\ge0}$ converges in law as $\varepsilon\to0$ in the Skorokhod space to a totally skewed $(1+\beta)$-stable process. Moreover, this process is a unique solution of a related stochastic differential equation of Ornstein-Uhlenbeck type, with a completely asymmetric stable L\'{e}vy noise.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.