Asymptotic behaviour near extinction of continuous state branching processes
Juan Carlos Pardo, Gabriel Berzunza

TL;DR
This paper investigates the near-extinction behavior of sub-critical continuous state branching processes, establishing a law of the iterated logarithm analogue for these processes and their reflected counterparts.
Contribution
It introduces a new asymptotic law near extinction for continuous state branching processes, extending classical results to this stochastic process class.
Findings
Established an analogue of Khintchin's law of the iterated logarithm near extinction.
Derived asymptotic behavior for the reflected process at its infimum.
Provided conditions under which the law applies.
Abstract
In this note, we study the asymptotic behaviour near extinction of (sub-) critical continuous state branching processes. In particular, we establish an analogue of Khintchin's law of the iterated logarithm near extinction time for a continuous state branching process whose branching mechanism satisfies a given condition and its reflected process at its infimum.
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 · Theoretical and Computational Physics · Markov Chains and Monte Carlo Methods
