The Oscillatory Distribution of Distances in Random Tries

@inproceedings{Christophi2005TheOD,
  title={The Oscillatory Distribution of Distances in Random Tries},
  author={Costas A. Christophi and Hosam M. Mahmoud},
  year={2005}
}
We investigate ∆n, the distance between randomly selected pairs of nodes among n keys in a random trie, which is a kind of digital tree. Analytical techniques, such as the Mellin transform and an excursion between poissonization and depoissonization, capture small fluctuations in the mean and variance of these random distances. The mean increases logarithmically in the number of keys, but curiously enough the variance remains O(1), as n → ∞. It is demonstrated that the centered random variable… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Oscillations in the analysis of algorithms and their cancellations

  • H. Prodinger
  • Journal of the Iranian Statistical Society
  • 2004

On the distribution for the duration of a randomized leader election algorithm

  • J. Fill, H. Mahmoud, W. Szpankowski
  • Ann . Appl . Probab .
  • 1996

Paths in a random digital tree : Limiting distribution

  • B. Pittel
  • Adv . in Appl . Probab .
  • 1986

Similar Papers

Loading similar papers…