Abstract

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, and profile of these trees and ordinary tries that apply without any conditions on the string distributions—they need not even be identically distributed.

Citations

1813	The Art of Computer Programming - Knuth - 1968
1128	Probability inequalities for sums of bounded random variables - Hoeffding - 1963
222	Concentration of measure and isoperimetric inequalities in product spaces - Talagrand - 1995
218	Trie Memory - Fredkin - 1962
189	Weighted sums of certain dependent random variables - Azuma - 1967
160	Patricia: A practical algorithm to retrieve information coded in alphanumeric - MORRISON - 1968
117	Concentration, Probabilistic methods for algorithmic discrete mathematics - McDiarmid
116	Sharper bounds for Gaussian and empirical processes - Talagrand - 1994
110	Probability inequalities for sums of bounded random variables - Hoeding - 1963
80	New concentration inequalities in product spaces - TALAGRAND - 1996
70	Expected length of the longest probe sequence in hash code searching - Gonnet - 1981
69	On Talagrand’s deviation inequalities for product measures - Ledoux - 1996
62	A sharp concentration inequality with applications. Random Structures and Algorithms - Boucheron, Lugosi, et al. - 2000
59	Digital search trees revisited - Flajolet, Sedgewick - 1986
52	Asymptotical growth of a class of random trees - Pittel - 1985
51	Paths in a random digital tree: Limiting distribution - Pittel - 1986
43	Dynamic sources in information theory: A general analysis of trie structures - CLEMENT, FLAJOLET, et al. - 2001
39	Analysis of digital tries with markovian dependency - JACQUET, W - 1991
38	Trie Partitioning Process: Limiting Distributions - Jacquet, Régnier - 1986
35	On the performance evaluation of the extendible hashing and trie searching - Flajolet - 1983
30	Limiting distribution for the depth in PATRICIA tries - Rais, Jacquet, et al. - 1993
29	logarithmic Sobolev inequalities on the discrete cube, and Margulis’ graph connectivity theorem - Isoperimetry - 1993
27	On the method of bounded differences, in ``Surveys in Combinatorics - McDiarmid - 1989
24	Isoperimetry and Gaussian analysis. Lectures on probability theory and statistics (Saint-Flour - Ledoux - 1994
22	A study of trie-like structures under the density - Devroye - 1992
22	On the height of digital trees and related problems - SZPANKOWSKI - 1991
21	A probabilistic analysis of the height of tries and of the complexity of triesort - Devroye - 1984
20	A new isoperimetric inequality and the concentration of measure phenomenon - Talagrand - 1991
19	A diffusion limit for a class of randomlygrowing binary trees. Probab. Theory Related Fields - Aldous, Shields - 1988
15	Some results on V -ary asymmetric tries - Szpankowski - 1988
13	A Note on the Probabilistic Analysis of Patricia Tries, Random Structures and Algorithms - Devroye - 1992
13	A branching process arising in dynamic hashing, trie searching and polynomial factorization - Flajolet, Steyaert - 1982
12	Analysis of extendible hashing - Mendelson - 1982
10	On the average height of trees in digital search and dynamic hashing. Information Processing Lett - Regnier - 1982
9	new isoperimetric inequalities for product measure, and the concentration of measure phenomenon - Talagrand, ”A - 1991
8	Isoperimetry and integrability of the sum of independent Banach-space valued random variables - Talagrand - 1989
7	The expected length of the longest probe sequence when the distribution is not uniform - Devroye - 1985
7	An isoperimetric theorem on the cube and the Kintchine-Kahane inequalities - Talagrand - 1988
7	A sharp concentration inequality with applications - Boucheron, Lugosi - 2000
6	How many random questions are necessary to identify n distinct objects - Pittel, Rubin - 1990
5	Trie hashing analysis - Régnier - 1988
5	New Gaussian estimates for enlarged balls - Talagrand - 1993
3	Some further results on digital trees - Kirschenhofer, Prodinger - 1986
3	Digital data structures and order statistics," in: Algorithms and Data Structures: Workshop WADS '89 - Szpankowski - 1989
2	Isoperimetry and gaussian analysis," in: Lectures on Probability Theory and Statistics, (edited by - Ledoux - 1996
2	On the method of bounded di#erences," in: Surveys in Combinatorics, (edited by - McDiarmid - 1989
2	On the height of patricia search tree - Pittel - 1991
2	Patricia trees again revisited - Szpankowski - 1990
2	Heights in generalized tries and PATRICIA tries," in: LATIN'2000 - Szpankowski, Knessl - 2000
1	Sample unboundedness of stochastic processes under increment conditions - Talagrand - 1990