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

Journal of Computational and Applied Mathematics

Volumn 142, Issue 1, 2002, Pages 27-37

  Devroye, Luc ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Concentration inequality; Height of a tree; Law of large numbers; PATRICIA tree; Probabilistic analysis; Trie

Indexed keywords

CODES (SYMBOLS); PROBABILITY;

TAIL INEQUALITIES;

RANDOM PROCESSES;

MATHEMATICAL ANALYSIS;

EID: 0036566516     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(01)00458-7     Document Type: Article

References (44)

1. Weighted sums of certain dependent random variables
2. A sharp concentration inequality with applications in random combinatorics and learning
3. Dynamical sources in information theory: A general analysis of trie structures
4. A probabilistic analysis of the height of tries and of the complexity of triesort
5. The expected length of the longest probe sequence when the distribution is not uniform
6. A note on the probabilistic analysis of PATRICIA trees
7. A study of trie-like structures under the density model
8. On the performance evaluation of extendible hashing and trie search
9. Digital search trees revisited
10. A branching process arising in dynamic hashing, trie searching and polynomial factorization
11. Trie memory
12. Expected length of the longest probe sequence in hash code searching
13. Trie partitioning process: Limiting distributions
14. Analysis of digital tries with Markovian dependency
15. Some further results on digital trees
16. On Talagrand's deviation inequalities for product measures
17. Isoperimetry and gaussian analysis
18. On the method of bounded differences
19. Concentration
20. Analysis of extendible hashing
21. PATRICIA-practical algorithm to retrieve information coded in alphanumeric
22. Asymptotical growth of a class of random trees
23. Path in a random digital tree: Limiting distributions
24. On the height of PATRICIA search tree
25. How many random questions are necessary to identify n distinct objects?
26. On the average height of trees in digital searching and dynamic hashing
27. Trie hashing analysis
28. Some results on V-ary asymmetric tries
29. Digital data structures and order statistics
30. Patricia trees again revisited
31. On the height of digital trees and related problems
32. Heights in generalized tries and PATRICIA tries, LATIN'2000
33. An isoperimetric theorem on the cube and the Kintchine-Kahane inequalities
34. Isoperimetry and integrability of the sum of independent Banach-space valued random variables
35. Sample unboundedness of stochastic processes under increment conditions
36. A new isoperimetric inequality and the concentration of measure phenomenon
37. A new isoperimetric inequality for product measure and the tails of sums of independent random variables
38. Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem
39. New gaussian estimates for enlarged balls
40. Sharper bounds for gaussian and empirical processes
41. Concentration of measure and isoperimetric inequalities in product spaces
42. New concentration inequalities in product spaces
43. A new look at independence