2012/12/12 by Romain Abraham, Abraham, Romain, Jean‐François Delmas +3
Computer Science · Mathematics · Physics and Astronomy · #Cellular Automata and Applications #FOS: Mathematics #Probability (math.PR) #Stochastic processes and statistical mechanics #Theoretical and Computational Physics
paper · pdf · doi:10.48550/arxiv.1212.2765
openalex publication_date 2012/12/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the pruning process developed by Abraham and Delmas (2012) on the discrete Galton-Watson sub-trees of the Lévy tree which are obtained by considering the minimal sub-tree connecting the root and leaves chosen uniformly at rate λ, see Duquesne and Le Gall (2002). The tree-valued process, as λ increases, has been studied by Duquesne and Winkel (2007). Notice that we have a tree-valued process indexed by two parameters the pruning parameter θ and the intensity λ. Our main results are: construction and marginals of the pruning process, representation of the pruning process (forward in time that is as θ increases) and description of the growing process (backward in time that is as θ decreases) and distribution of the ascension time (or explosion time of the backward process) as well as the tree at the ascension time. A by-product of our result is that the super-critical Lévy trees independently introduced by Abraham and Delmas (2012) and Duquesne and Winkel (2007) coincide. This work is also related to the pruning of discrete Galton-Watson trees studied by Abraham, Delmas and He (2012).