Pruning Galton-Watson Trees and Tree-valued Markov Processes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques Année : 2012

Pruning Galton-Watson Trees and Tree-valued Markov Processes

Résumé

We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{ {\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous process $\{{\cal G}^*(u)\}$ by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that the process $\{{\cal G}(u)\}$ run until its ascension time has a representation in terms of $\{{\cal G}^*(u)\}$. A similar result was obtained by Aldous and Pitman (1998) in the special case of Poisson offspring distributions where they considered uniform pruning of Galton-Watson trees by adding marks on the edges of trees.
Fichier principal
Vignette du fichier
GW_final.pdf (207.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00497035 , version 1 (02-07-2010)
hal-00497035 , version 2 (07-02-2011)

Identifiants

Citer

Romain Abraham, Jean-François Delmas, Hui He. Pruning Galton-Watson Trees and Tree-valued Markov Processes. Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques, 2012, 48 (3), pp.688-705. ⟨10.1214/11-AIHP423⟩. ⟨hal-00497035v2⟩
181 Consultations
206 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More