A continuum-tree-valued Markov process

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 Tθ has branching mechanism θ. It is sub-critical if θ>0 and super-critical if θ<0. We then consider the explosion time A of the CRT: the smaller (negative) time θ for which Tθ has finite mass. We describe the law of A as well as the distribution of the CRT just after this explosion time. The CRT just after explosion can be seen as a CRT conditioned not to be extinct which is pruned with an independent intensity related to A. We also study the evolution of the CRT-valued process after the explosion time. This extends results from Aldous and Pitman on Galton-Watson trees. For the particular case of the quadratic branching mechanism, we show that after explosion the total mass of the CRT behaves like the inverse of a stable subordinator with index 1/2. This result is related to the size of the tagged fragment for the fragmentation of Aldous' CRT.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…