Distribution of Inter-Node Distances in Digital Trees

Conference Paper

Mahmoud, Rafik Aguech, Nabil Lasmar, Hosam . 2005

• نوع عمل المنشور: Proceedings
• رابط المنشور على الويب: Pdf
• الوسوم: Research paper
• اسم المؤتمر: 2005 International Conference on Analysis of Algorithms
• عنوان المؤتمر: DCMTCS
• تاريخ المؤتمر: الثلاثاء, أيلول (سبتمبر) 20, 2005
• المنظمة الراعية: INRIA France

مستخلص المنشور

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.