Binary trees, exploration processes, and an extented Ray--Knight Theorem
classification
🧮 math.PR
keywords
binaryexplorationray--knighttheoremtreesbijectioncasescontinuous
read the original abstract
We study the bijection between binary Galton--Watson trees in continuous time and their exploration process, both in the sub- and in the supercritical cases. We then take the limit over renormalized quantities, as the size of the population tends to infinity. We thus deduce Delmas' generalization of the second Ray--Knight theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.