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

DOI10.1051/ps:2008035zbMath1213.60044MaRDI QIDQ3085582

Eric Fekete

Publication date: 31 March 2011

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/44692

zbMATH Keywords

occupation measure; fragmentation; branching random walk; random binary search tree; recursive tree

Mathematics Subject Classification ID

68W40: Analysis of algorithms

60F05: Central limit and other weak theorems

05C05: Trees

60G50: Sums of independent random variables; random walks

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Related Items

Interplay of analysis and probability in applied mathematics. Abstracts from the workshop held February 11--17, 2018

Cites Work

• Martingales and profile of binary search trees
• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• The left-right-imbalance of binary search trees
• Width and mode of the profile for some random trees of logarithmic height
• Random planar lattices and integrated superBrownian excursion
• The asymptotic behavior of fragmentation processes
• Distribution of distances in random binary search trees.
• Tree-based models for random distribution of mass
• Convergence of discrete snakes
• The scaling limit of the incipient infinite cluster in high-dimensional percolation. II. Integrated super-Brownian excursion
• On Random Binary Trees
• Exact and asymptotic distributions in digital and binary search trees
• Martingale convergence in the branching random walk
• The rotation correspondence is asymptotically a dilatation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item