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

DOI10.1051/ps:2008035zbMath1213.60044OpenAlexW2036636371MaRDI 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 measurefragmentationbranching random walkrandom binary search treerecursive tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Central limit and other weak theorems (60F05) Trees (05C05) Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Branching random walks on binary search trees: convergence of the occupation measure