A continuum-tree-valued Markov process
Romain Abraham (MAPMO), Jean-Fran\c{c}ois Delmas (CERMICS)

TL;DR
This paper constructs a super-critical Lévy continuum random tree (CRT) process using exploration and Girsanov's theorem, extends pruning to this case, and analyzes the explosion time and post-explosion behavior, generalizing Aldous and Pitman's results.
Contribution
It introduces a novel construction of super-critical CRTs via pruning and explores their explosion times and subsequent evolution, extending classical results to a broader setting.
Findings
Construction of super-critical Lévy CRTs using exploration and Girsanov's theorem
Description of the law of explosion time and post-explosion CRT distribution
For quadratic branching, total mass after explosion behaves like the inverse of a stable subordinator
Abstract
We present a construction of a L\'evy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov's theorem. We also extend the pruning procedure to this super-critical case. Let be a critical branching mechanism. We set . Let or be the set of values of for which is a branching mechanism. The pruning procedure allows to construct a decreasing L\'evy-CRT-valued Markov process , such that has branching mechanism . It is sub-critical if and super-critical if . We then consider the explosion time of the CRT: the smaller (negative) time for which…
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.
