Random recursive trees and the Bolthausen-Sznitman coalescent.
Goldschmidt, Christina, Martin, James B. (2005)
Electronic Journal of Probability [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the number of descendants and ascendants in random search trees.”
Random recursive trees and the Bolthausen-Sznitman coalescent.
On the Horton-Strahler number for random tries
L. Devroye, P. Kruszewski (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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...
Descendants in increasing trees.
Kuba, Markus, Panholzer, Alois (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The lower tail of the random minimum spanning tree.
Flaxman, Abraham D. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Descendants in heap ordered trees or a triumph of computer algebra.
Prodinger, Helmut (1996)
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 walk on periodic trees.
Takacs, Christiane (1997)
Electronic Journal of Probability [electronic only]
Similarity:
Analysis of some statistics for increasing tree families.
Panholzer, Alois, Prodinger, Helmut (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.
Iksanov, Alex, Möhle, Martin (2007)
Electronic Communications in Probability [electronic only]
Similarity: