Distribution of inter-node distances in digital trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Distribution of inter-node distances in digital trees


We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances. The program is illustrated on the mean and variance. One encounters delayed Mellin transform equations, which we solve by inspection. Interestingly, the unbiased case gives a bounded variance, whereas the biased case gives a variance growing with the number of keys. It is therefore possible in the biased case to show that an appropriately normalized version of the distance converges to a limit. The complexity of moment calculation increases substantially with each higher moment; A shortcut to the limit is needed via a method that avoids the computation of all moments. Toward this end, we utilize the contraction method to show that in biased digital search trees the distribution of a suitably normalized version of the distances approaches a limit that is the fixed-point solution (in the Wasserstein space) of a distributional equation. An explicit solution to the fixed-point equation is readily demonstrated to be Gaussian.
Fichier principal
Vignette du fichier
dmAD0101.pdf (102.88 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184045 , version 1 (12-08-2015)



Rafik Aguech, Nabil Lasmar, Hosam Mahmoud. Distribution of inter-node distances in digital trees. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.1-10, ⟨10.46298/dmtcs.3373⟩. ⟨hal-01184045⟩


71 View
458 Download



Gmail Facebook Twitter LinkedIn More