1 January 1993 in Random Structures & Algorithms
1 March 1989 in Journal of Algorithms
1 January 1991 in Probability in the Engineering and Informational Sciences
The depth of insertion and the internal path length of recursive trees are studied. Luc Devroye has recently shown that the depth of insertion in recursive trees is asymptotically normal. We give a direct alternative elementary proof of this fact. Furthermore, via the theory of martingales, we show thatIn, the internal path length of a recursive tree of ordern, converges to a limiting distribution. In fact, we show that there exists a random variableIsuch that (In–nIn n)/n→Ialmost surely and in quadratic mean, asn→ α. The method admits, in passing, the calculation of the first two moments ofIn.
1 November 1996 in The Annals of Applied Probability
We investigate the duration of an elimination process for identifying a winner by coin tossing or, equivalently, the height of a random incomplete trie. Applications of the process include the election of a leader in a computer network. Using direct probabilistic arguments we obtain exact expressions for the discrete distribution and the moments of the height. Elementary approximation techniques then yield asymptotics for the distribution. We show that no limiting distribution exists, as the asymptotic expressions exhibit periodic fluctuations. In many similar problems associated with digital trees, no such exact expressions can be derived. We therefore outline a powerful general approach, based on the analytic techniques of Mellin transforms, Poissonization and de-Poissonization, from which distributional asymptotics for the height can also be derived. In fact, it was this complex variables approach that led to our original discovery of the exact distribution. Complex analysis methods are indispensable for deriving asymptotic expressions for the mean and variance, which also contain periodic terms of small magnitude.
1 August 1992 in Journal of Computational and Applied Mathematics