Displaying similar documents to “On the average growth of random Fibonacci sequences.”

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

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

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