Propriété asymptotique d’un modèle statistique pour une chaîne de Markov à valeurs dans
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 by pruning Galton–Watson trees and an analogous process 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 run until its ascension time has a representation in terms of . A similar result was obtained by Aldous and...
One way to represent the generator of a Markov process is given by pseudo differential operators. Above all this is due to the fact that the generator satisfies the so-called positive maximum principle (...).