On the re-rooting invariance property of Lev́y trees.
Duquesne, Thomas, Le Gall, Jean-Francois (2009)
Electronic Communications in Probability [electronic only]
Similarity:
Duquesne, Thomas, Le Gall, Jean-Francois (2009)
Electronic Communications in Probability [electronic only]
Similarity:
Jean-François Le Gall (2006)
Annales de la faculté des sciences de Toulouse Mathématiques
Similarity:
We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of the relations between discrete Galton-Watson trees and continuous random trees. We then discuss the particular class of self-similar random real trees called stable trees, which generalize the CRT. We review several important results concerning...
Zhan Shi (2011)
ESAIM: Proceedings
Similarity:
These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to the main part, Section 3, where branching...
Geiger, Jochen (2000)
Electronic Journal of Probability [electronic only]
Similarity:
Takács, Lajos (1991)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Duerre, Maximilian (2006)
Electronic Communications in Probability [electronic only]
Similarity:
Eric Fekete (2010)
ESAIM: Probability and Statistics
Similarity:
We consider branching random walks with binary search trees as underlying trees. We show that the occupation measure of the branching random walk, up to some scaling factors, converges weakly to a deterministic measure. The limit depends on the stable law whose domain of attraction contains the law of the increments. The existence of such stable law is our fundamental hypothesis. As a consequence, using a one-to-one correspondence between binary trees and plane trees, we give a description...
Grégory Miermont (2008)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We prove that critical multitype Galton–Watson trees converge after rescaling to the brownian continuum random tree, under the hypothesis that the offspring distribution is irreducible and has finite covariance matrices. Our study relies on an ancestral decomposition for marked multitype trees, and an induction on the number of types. We then couple the genealogical structure with a spatial motion, whose step distribution may depend on the structure of the tree in a local way, and show...