One-sided variations on interval trees

DOI10.1239/jap/1059060894zbMath1043.05036OpenAlexW2083179449MaRDI QIDQ4462695

Hosam M. Mahmoud, Yoshiaki Itoh

Publication date: 18 May 2004

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

Full work available at URL: https://doi.org/10.1239/jap/1059060894

zbMATH Keywords

treedifferential equationTauberian theoremsrandom graphlimit distribution

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Qualitative investigation and simulation of ordinary differential equation models (34C60)

Related Items

One-sided variations on binary search trees, Paths in \(m\)-ary interval trees, Normal limiting distribution of the size of binary interval trees, The size of random fragmentation trees, Perpetuities in Fair Leader Election Algorithms, Fragment size distributions in random fragmentations with cutoff, Probabilistic analysis of maximal gap and total accumulated length in interval division

Cites Work

• How to select a loser
• Random sequential bisection and its associated binary tree
• On the distribution for the duration of a randomized leader election algorithm
• One-sided variations on binary search trees
• On the contraction method with degenerate limit equation.
• A note on the height of binary search trees
• A limit theorem for “quicksort”
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item