Martingales and profile of binary search trees

DOI10.1214/EJP.v10-257zbMath1109.60059arXivmath/0410211MaRDI QIDQ850350

N. E. Zubov

Publication date: 3 November 2006

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0410211

Mathematics Subject Classification ID

60G42: Martingales with discrete parameter

60J25: Continuous-time Markov processes on general state spaces

60C05: Combinatorial probability

60G44: Martingales with continuous parameter

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

Related Items

Shape Measures of Random Increasing k-trees, Cutting Edges at Random in Large Recursive Trees, On martingale tail sums for the path length in random trees, The degree profile of random Pólya trees, A survey of max-type recursive distributional equations, A functional limit theorem for the profile of \(b\)-ary trees, Edgeworth expansions for profiles of lattice branching random walks, General Edgeworth expansions with applications to profiles of random trees, Search trees: metric aspects and strong limit theorems, A functional limit theorem for the profile of search trees, A Strong Law for the Size of Yule M-Oriented Recursive Trees, Limit Theorems for Subtree Size Profiles of Increasing Trees, Branching random walks on binary search trees: convergence of the occupation measure, A sprouting tree model for random boolean functions