March 2012 Binary trees, exploration processes, and an extended Ray-Knight theorem
Mamadou Ba, Etienne Pardoux, Ahmadou Bamba Sow
Author Affiliations +
J. Appl. Probab. 49(1): 210-225 (March 2012). DOI: 10.1239/jap/1331216843

Abstract

We study the bijection between binary Galton-Watson trees in continuous time and their exploration process, both in the subcritical and in the supercritical cases. We then take the limit over renormalized quantities, as the size of the population tends to ∞. We thus deduce Delmas' generalization of the second Ray-Knight theorem.

Citation

Download Citation

Mamadou Ba. Etienne Pardoux. Ahmadou Bamba Sow. "Binary trees, exploration processes, and an extended Ray-Knight theorem." J. Appl. Probab. 49 (1) 210 - 225, March 2012. https://doi.org/10.1239/jap/1331216843

Information

Published: March 2012
First available in Project Euclid: 8 March 2012

zbMATH: 1252.60086
MathSciNet: MR2952891
Digital Object Identifier: 10.1239/jap/1331216843

Subjects:
Primary: 60F17 , 60J80
Secondary: 92D25

Keywords: Exploration process , Feller's branching , Galton-Watson process , Ray-Knight theorem

Rights: Copyright © 2012 Applied Probability Trust

JOURNAL ARTICLE
16 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.49 • No. 1 • March 2012
Back to Top