Abstract
We consider digital trees such as (generalized) tries and PATRICIA tries, built from n random strings generated by an unbiased memoryless source (i.e., all symbols are equally likely). We study limit laws of the height which is defined as the longest path in such trees. For tries, in the region where most of the probability mass is concentrated, the asymptotic distribution is of extreme value type (i.e., double exponential distribution). Surprisingly enough, the height of the PATRICIA trie behaves quite differently in this region: It exhibits an exponential of a Gaussian distribution (with an oscillating term) around the most probable value \(k_1=\lfloor \log_2 n + \sqrt{2\log_2 n} -- \frac{3}{2}\rfloor + 1\). In fact, the asymptotic distribution of PATRICIA height concentrates on one or two points. For most n all the mass is concentrated at k 1, however, there exist subsequences of n such that the mass is on the two points k 1 − 1 and k 1, or k 1 and k 1 + 1. We derive these results by a combination of analytic methods such as generating functions, Mellin transform, the saddle point method and ideas of applied mathematics such as linearization, asymptotic matching and the WKB method.
The work was supported by NSF Grant DMS-93-00136 and DOE Grant DE-FG02-93ER25168, as well as by NSF Grants NCR-9415491, NCR-9804760.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Devroye, L.: A Probabilistic Analysis of the Height of Tries and the complexity of Trie Sort. Acta Informatica 21, 229–237 (1984)
Devroye, L.: A Note on the Probabilistic Analysis of Patricia Tries. Random Structures & Algorithms 3, 203–214 (1992)
Devroye, L.: A Study of Trie-Like Structures Under the Density Model. Ann. Appl. Probability 2, 402–434 (1992)
Flajolet, P.: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Informatica 20, 345–369 (1983)
Froman, N., Froman, P.: JWKB Approximation. North-Holland, Amsterdam (1965)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
Jacquet, P., Régnier, M.: Trie Partitioning Process: Limiting Distributions. In: Franchi-Zannettacci, P. (ed.) CAAP 1986. LNCS, vol. 214, pp. 196–210. Springer, Heidelberg (1986)
Jacquet, P., Szpankowski, W.: Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees. Theoretical Computer Science 144, 161–197 (1995)
Knuth, D.: The Art of Computer Programming. Sorting and Searching, 2nd edn. Addison-Wesley, Reading (1998)
Knessl, C., Szpankowski, W.: Quicksort Algorithm Again Revisited. Discrete Mathematics and Theoretical Computer Science 3, 43–64 (1999)
Lagerstrom, P.: Matched Asymptotic Expansions: Ideas and Techniques. Springer, New York (1988)
Mahmoud, H.: Evolution of Random Search Trees. John Wiley & Sons, New York (1992)
Pittel, B.: Asymptotic Growth of a Class of Random Trees. Ann. of Probab. 13, 414–427 (1985)
Pittel, B.: Path in a Random Digital Tree: Limiting Distributions. Adv. Appl. Prob. 18, 139–155 (1986)
Pittel, B., Rubin, H.: How Many Random Questions Are Necessary to Identify n Distinct Objects? J. Combin. Theory, Ser. A. 55, 292–312 (1990)
Szpankowski, W.: Patricia Tries Again Revisited. Journal of the ACM 37, 691–711 (1990)
Szpankowski, W.: On the Height of Digital Trees and Related Problems. Algorithmica 6, 256–277 (1991)
Szpankowski, W.: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors. SIAM J. Compt. 22, 1176–1198 (1993)
Ziv, J., Lempel, A.: Compression of Individual Sequences via Variable-rate Coding. IEEE Trans. Information Theory 24, 530–536 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knessl, C., Szpankowski, W. (2000). Heights in Generalized Tries and PATRICIA Tries. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_31
Download citation
DOI: https://doi.org/10.1007/10719839_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive