[hal-01083405] Digital Trees and Memoryless Sources: from Arithmetics to Analysis

Digital trees, also known as \emph``tries'', are fundamental to a number of algorithmic schemes, including radix-based searching and sorting, lossless text compression, dynamic hashing algorithms, communication protocols of the tree or stack type, distributed leader election, and so on. This extended abstract develops the asymptotic form of expectations of the main parameters of interest, such as tree size and path length. The analysis is conducted under the simplest of all probabilistic models; namely, the \emphmemoryless source, under which letters that data items are comprised of are drawn independently from a fixed (finite) probability distribution. The precise asymptotic structure of the parameters' expectations is shown to depend on fine singular properties in the complex plane of a ubiquitous \emphDirichlet series. Consequences include the characterization of a broad range of asymptotic regimes for error terms associated with trie parameters, as well as a classification that depends on specific \empharithmetic properties, especially irrationality measures, of the sources under consideration.

from HAL : Dernières publications http://ift.tt/1JiNsGX