A tree-valued Markov processes associated with an admissible family of branching mechanisms
Abstract
By studying an admissible family of branching mechanisms introduced in Li (2014), we obtain a pruning procedure on L\'evy trees. Then we could construct a decreasing L\'evy-CRT-valued process \ Tt\ by pruning L\'evy trees and an analogous process \ T*t\ by pruning a critical L\'evy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of \ Tt\ at the ascension time can be represented by \ T*t\. The results generalize those studied in Abraham and Delmas (2012).
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.