The oscillatory distribution of distances in random tries

DOI10.1214/105051605000000106zbMath1071.60007arXivmath/0505259OpenAlexW3099976229MaRDI QIDQ558689

Hosam M. Mahmoud, Costas A. Christophi

Publication date: 13 July 2005

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0505259

zbMATH Keywords

Mellin transformrecurrencePoissonization

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Searching and sorting (68P10) Combinatorial probability (60C05) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (9)

Distances in random digital search trees ⋮ Labels distance in bucket recursive trees with variable capacities of buckets ⋮ Average-Case Analysis of Cousins in m-ary Tries ⋮ On the distribution of distances between specified nodes in increasing trees ⋮ Analysis of Steiner subtrees of random trees for traceroute algorithms ⋮ ON CLIMBING TRIES ⋮ Limit laws for the Randić index of random binary tree models ⋮ Limit distribution of distances in biased random tries ⋮ The Wiener Index of Random Digital Trees

Cites Work

• Analytical depoissonization and its applications
• On the distribution for the duration of a randomized leader election algorithm
• Distribution of distances in random binary search trees.
• Spanning tree size in random binary search trees.
• Paths in a random digital tree: limiting distributions
• File structures using hashing functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The oscillatory distribution of distances in random tries