Study of Random Biased d-ary Tries Model
Authors
Abstract:
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial approach for studying of average profile, since its probability distribution is unknown. We obtain the probability distribution of depth and the distribution function of height as n is large. These results follow from the study of certain recurrence equations that we solve by a analytic method.
similar resources
Limit Distribution of Distances in Biased Random Tries
The trie is a sort of digital tree. Ideally, to achieve balance, the trie should grow from an unbiased source generating keys of bits with equal likelihoods. In practice, the lack of bias is not always guaranteed. We investigate the distance between randomly selected pairs of nodes among the keys in a biased trie. This research complements that of Christophi and Mahmoud (2005); however, the res...
full textA Multivariate Study on the Size of m-ary Tries and PATRICIA Tries
Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show that a slight modification of this framework yields limit laws as well. As an application, we cons...
full textSome Results on V-ary Asymmetric Tries
Tries (radix: search tries) appear in many applications. It is assumed that a trie is built over an alphabet U = {crt, ...• O'v} (V-ary me), and keys are strings of elements from U. The occurrence of an element (Ji in a key is represented by a probability Pi (asymmetric trie). OUf main interest is to compute the depth of a leaf and lhe external path length. By solving a system of recurrences we...
full textAnalysis of random LC tries
LC tries were introduced by Andersson and Nilsson in 1993. They are compacted versions of tries or patricia tries in which, from the top down, maximal height complete subtrees are level compressed. Andersson and Nilsson (1993) showed that for i.i.d. uniformly distributed input strings, the expected depth of the LC patricia trie is (log n). In this paper, we reene and extend this result. We anal...
full textA General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries
Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show that a slight modification of this framework yields a central limit theorem for shape parameters, ...
full textBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
full textMy Resources
Journal title
volume 2 issue 2
pages 39- 50
publication date 2017-03
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023