Digital Trees and Memoryless Sources: from Arithmetics to Analysis - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

Digital Trees and Memoryless Sources: from Arithmetics to Analysis

(1) , (2, 3) , (2)


Digital trees, also known as $\textit{"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 $\textit{memoryless 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 $\textit{Dirichlet 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 $\textit{arithmetic properties}$, especially irrationality measures, of the sources under consideration.
Fichier principal
Vignette du fichier
dmAM0117.pdf (808.47 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01083405 , version 1 (17-11-2014)
hal-01083405 , version 2 (20-08-2015)



Philippe Flajolet, Mathieu Roux, Brigitte Vallée. Digital Trees and Memoryless Sources: from Arithmetics to Analysis. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.233-260, ⟨10.46298/dmtcs.2799⟩. ⟨hal-01083405v2⟩
554 View
470 Download



Gmail Facebook Twitter LinkedIn More