Asymptotic variance of random symmetric digital search trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Asymptotic variance of random symmetric digital search trees

Abstract

Asymptotics of the variances of many cost measures in random digital search trees are often notoriously messy and involved to obtain. A new approach is proposed to facilitate such an analysis for several shape parameters on random symmetric digital search trees. Our approach starts from a more careful normalization at the level of Poisson generating functions, which then provides an asymptotically equivalent approximation to the variance in question. Several new ingredients are also introduced such as a combined use of the Laplace and Mellin transforms and a simple, mechanical technique for justifying the analytic de-Poissonization procedures involved. The methodology we develop can be easily adapted to many other problems with an underlying binomial distribution. In particular, the less expected and somewhat surprising n (logn)(2)-variance for certain notions of total path-length is also clarified.
Fichier principal
Vignette du fichier
1489-4997-2-PB.pdf (836.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990457 , version 1 (13-05-2014)

Identifiers

Cite

Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas. Asymptotic variance of random symmetric digital search trees. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 2 (2), pp.103-165. ⟨10.46298/dmtcs.498⟩. ⟨hal-00990457⟩

Collections

TDS-MACS
46 View
856 Download

Altmetric

Share

Gmail Facebook X LinkedIn More