The Annals of Applied Probability

Rates of Convergence for the Move-to-Root Markov Chain for Binary Search Trees

Robert P. Dobrow and James Allen Fill

Full-text: Open access

Abstract

The move-to-root heuristic is a self-organizing rule that attempts to keep a binary search tree in near-optimal form. It is a tree analogue of the move-to-front scheme (also known as the weighted random-to-top card shuffle or Tsetlin library) for self-organizing lists. We study convergence of the move-to-root Markov chain to its stationary distribution and show that move-to-root converges two to four times faster than move-to-front for many examples. We also discuss asymptotics for expected search cost. For equal weights, $\operatorname{cn}/\ln n$ steps are necessary and sufficient to drive the maximum relative error to 0.

Article information

Source
Ann. Appl. Probab., Volume 5, Number 1 (1995), 20-36.

Dates
First available in Project Euclid: 19 April 2007

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1177004825

Digital Object Identifier
doi:10.1214/aoap/1177004825

Mathematical Reviews number (MathSciNet)
MR1325038

Zentralblatt MATH identifier
0822.60059

JSTOR
links.jstor.org

Subjects
Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 68P10: Searching and sorting 68P05: Data structures

Keywords
Markov chains convergence to stationarity self-organizing search binary search trees move-to-root rule move-to-front rule

Citation

Dobrow, Robert P.; Fill, James Allen. Rates of Convergence for the Move-to-Root Markov Chain for Binary Search Trees. Ann. Appl. Probab. 5 (1995), no. 1, 20--36. doi:10.1214/aoap/1177004825. https://projecteuclid.org/euclid.aoap/1177004825


Export citation