Pruning Galton-Watson Trees and Tree-valued Markov Processes

Details Pruning Galton-Watson Trees and Tree-valued Markov Processes Pruning Galton-Watson Trees and Tree-valued Markov Processes

2010-07-02

arxiv.org/abs/1007.0370v2

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pruning Galton-Watson Trees and Tree-valued Markov Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pruning Galton-Watson Trees and Tree-valued Markov Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pruning Galton-Watson Trees and Tree-valued Markov Processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727510