Branching random walks on binary search trees:   convergence of the occupation measure

Eric Fekete

Displaying similar documents to “Branching random walks on binary search trees: convergence of the occupation measure”

Descendants in increasing trees.

Kuba, Markus, Panholzer, Alois (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Random Walks and Trees

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...

Random recursive trees and the Bolthausen-Sznitman coalescent.

Goldschmidt, Christina, Martin, James B. (2005)

Electronic Journal of Probability [electronic only]

Similarity:

Random real trees

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...