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 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 has finite mass. We describe the law of 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 . 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.
Keywords
Cite
@article{arxiv.0904.4175,
title = {A continuum-tree-valued Markov process},
author = {Romain Abraham and Jean-François Delmas},
journal= {arXiv preprint arXiv:0904.4175},
year = {2012}
}