Pruning a Lévy continuum random tree - Mathematics > ProbabilityReport as inadecuate

Pruning a Lévy continuum random tree - Mathematics > Probability - Download this document for free, or read online. Document in PDF available to download.

Abstract: Given a general critical or sub-critical branching mechanism, we define apruning procedure of the associated L\-evy continuum random tree. This pruningprocedure is defined by adding some marks on the tree, using L\-evy snaketechniques. We then prove that the resulting sub-tree after pruning is still aL\-evy continuum random tree. This last result is proved using the explorationprocess that codes the CRT, a special Markov property and martingale problemsfor exploration processes. We finally give the joint law under the excursionmeasure of the lengths of the excursions of the initial exploration process andthe pruned one.

Author: Romain Abraham MAPMO, Jean-Francois Delmas CERMICS, Guillaume Voisin MAPMO


Related documents