Imbalance in random digital trees

DOI10.1007/s11009-008-9087-1zbMath1200.05205OpenAlexW2091484423MaRDI QIDQ1023981

Hosam M. Mahmoud

Publication date: 16 June 2009

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-008-9087-1

zbMATH Keywords

Mellin transformtrieGaussian limit lawdigital treeimbalance factor

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (1)

Renewal theory in the analysis of tries and strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mellin transforms and asymptotics: Harmonic sums
• Distances in random digital search trees
• Left and right pathlengths in random binary trees
• The left-right-imbalance of binary search trees
• Analytical depoissonization and its applications
• Limit distribution of distances in biased random tries
• Limit laws for embedded trees: Applications to the integrated superBrownian excursion
• Paths in a random digital tree: limiting distributions
• The rotation correspondence is asymptotically a dilatation
• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
• ON CLIMBING TRIES

This page was built for publication: Imbalance in random digital trees