Martingales and Profile of Binary Search Trees
Brigitte Chauvin, Thierry Klein, Jean-Francois Marckert, Alain Rouault
Abstract
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in particular the asymptotic behavior of the profile.
Create a lesson
Related papers
Almost sure exponential stability of multi-dimensional stochastic systems driven by a symmetric α-stable process
Xuekang Zhang, Hongjian Liu, Guangjun Shen
The Arc Threshold of the Two-Row Ising Torus: Exact Factorization, an Algebraic Critical Coupling, Uniformity in the Circumference, and the Rate of Convergence
Marco Mandap
Markovian Lifts and Multifactor Approximations for Weighted Sub-fractional Brownian Motion
J. H. Ramirez-Gonzalez, Edison Cuba
Rényi mixing bounds for kinetic samplers via L2 hypocoercivity
Jianfeng Lu, Yinchen Luo
Bayesian Filters via the Stochastic Category
Kenichi Bannai, Masahiro Kurisaki
Synchronization of Enriched Spin Glasses
Franziska Engler, Justin Ko