# Digital Trees and Memoryless Sources: from Arithmetics to Analysis

1 ALGO - Algorithms
Inria Paris-Rocquencourt
2 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : 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.
Keywords :
Domain :

Cited literature [24 references]

https://hal.inria.fr/hal-01083405
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 4:33:54 PM
Last modification on : Friday, June 28, 2019 - 4:38:33 PM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 10:12:18 AM

### File

dmAM0117.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01083405, version 2

### Citation

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. ⟨hal-01083405v2⟩

Record views