Digital Trees and Memoryless Sources: from Arithmetics to Analysis - GREYC amacc Access content directly
Conference Papers Year : 2010

Digital Trees and Memoryless Sources: from Arithmetics to Analysis

Abstract

Digital trees, also known as "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 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 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 arithmetic properties, especially irrationality measures, of the sources under consideration.
Fichier principal
Vignette du fichier
ACTI-FLAJOLET-2010-2.pdf (643.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Licence

Attribution

Identifiers

  • HAL Id : hal-01083405 , version 1

Cite

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) , Jun 2010, Vienne, Austria. pp.231-258. ⟨hal-01083405v1⟩

Collections

GREYC
572 View
622 Download

Share

Gmail Facebook X LinkedIn More