Laws of large numbers and tail inequalities for random tries and PATRICIA trees

Authors:
Luc Devroye
Affiliations:
School of Computer Science, McGill University, 3480 University, Montreal, Quebec, Canada
Venue:
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Year:
2002

Citing 15
Cited 6

Digital search trees revisited

SIAM Journal on Computing
Some results on V-ary asymmetric tries

Journal of Algorithms
How many random questions are necessary to identify n distinct objects?

Journal of Combinatorial Theory Series A
Patricia tries again revisited

Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Expected Length of the Longest Probe Sequence in Hash Code Searching

Journal of the ACM (JACM)
A sharp concentration inequality with application

Random Structures & Algorithms
Trie memory

Communications of the ACM
Trie Hashing Analysis

Proceedings of the Fourth International Conference on Data Engineering
Digital Data Structures and Order Statistics

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Some Further Results on Digital Search Trees

ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
Heights in Generalized Tries and PATRICIA Tries

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Trie Partitioning Process: Limiting Distributions

CAAP '86 Proceedings of the 11th Colloquium on Trees in Algebra and Programming

Concentration of Size and Path Length of Tries

Combinatorics, Probability and Computing
Concentration for self-bounding functions and an inequality of Talagrand

Random Structures & Algorithms
Multiple choice tries and distributed hash tables

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An analysis of the height of tries with random weights on the edges

Combinatorics, Probability and Computing
Profile of tries

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The degree profile of random Pólya trees

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider random tries and random PATRICIA trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. If Hn, is the height of this tree, we show that Hn/E{Hn} tends to one in probability. Additional tail inequalities are given for the height, depth, size, internal path length, and profile of these trees and ordinary tries that apply without any conditions on the string distributions---they need not even be identically distributed.