One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling

Abstract

One-sided variations on path length in a trie (a sort of digital trees) are investigated: They include imbalance factors, climbing under different strategies, and key sampling. For the imbalance factor accurate asymptotics for the mean are derived for a randomly chosen key in the trie via poissonization and the Mellin transform, and the inverse of the two operations. It is also shown from an analysis of the moving poles of the Mellin transform of the poissonized moment generating function that the imbalance factor (under appropriate centering and scaling) follows a Gaussian limit law. The method extends to several variations of sampling keys from a trie and we sketch results of climbing under different strategies. The exact probability distribution is computed in one case, to demonstrate that such calculations can be done, at least in principle.
Fichier principal
Vignette du fichier
dmAH0123.pdf (195.39 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184770 , version 1 (17-08-2015)

Identifiers

Cite

Costas A. Christophi, Hosam M. Mahmoud. One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.333-344, ⟨10.46298/dmtcs.3522⟩. ⟨hal-01184770⟩

Collections

INSMI TDS-MACS
31 View
558 Download

Altmetric

Share

Gmail Facebook X LinkedIn More