On Tail Bounds for Random Recursive Trees

DOI10.1239/jap/1339878805zbMath1251.60009OpenAlexW1986816810MaRDI QIDQ2897163

Goetz Olaf Munsonius

Publication date: 8 July 2012

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

Full work available at URL: https://projecteuclid.org/euclid.jap/1339878805

zbMATH Keywords

probabilistic analysis of algorithmsWiener indexrandom treetail boundpath length

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (1)

The Wiener Index of Random Digital Trees

Cites Work

• Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
• Large deviations for the weighted height of an extended class of trees
• The center of mass of the ISE and the Wiener index of trees
• Approximating the limiting Quicksort distribution
• Large Deviations for Quicksort
• Note on the heights of random recursive trees and random m‐ary search trees
• A limit theorem for “quicksort”
• The height of increasing trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Tail Bounds for Random Recursive Trees