Open Access
May, 1992 A Study of Trie-Like Structures Under the Density Model
Luc Devroye
Ann. Appl. Probab. 2(2): 402-434 (May, 1992). DOI: 10.1214/aoap/1177005709

Abstract

We consider random tries constructed from sequences of i.i.d. random variables with a common density f on [0,1] (i.e., paths down the tree are carved out by the bits in the binary expansions of the random variables). The depth of insertion of a node and the height of a node are studied with respect to their limit laws and their weak and strong convergence properties. In addition, laws of the iterated logarithm are obtained for the height of a random trie when f2<. Finally, we study two popular improvements of the trie, the PATRICIA tree and the digital search tree, and show to what extent they improve over the trie.

Citation

Download Citation

Luc Devroye. "A Study of Trie-Like Structures Under the Density Model." Ann. Appl. Probab. 2 (2) 402 - 434, May, 1992. https://doi.org/10.1214/aoap/1177005709

Information

Published: May, 1992
First available in Project Euclid: 19 April 2007

zbMATH: 0758.68051
MathSciNet: MR1161060
Digital Object Identifier: 10.1214/aoap/1177005709

Subjects:
Primary: 60D05
Secondary: 68U05

Keywords: digital search tree , height of a tree , probabilistic analysis , strong convergence , Trie

Rights: Copyright © 1992 Institute of Mathematical Statistics

Vol.2 • No. 2 • May, 1992
Back to Top