An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
On certain properties of random apollonian networks
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
| Hi-index | 0.00 |
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn* of a large class of random trees for which Hn* ∼ c log n for some positive constant c. A graphical interpretation is also given for the limit constant c. This unifies what was already known for binary search trees, random recursive trees and plane oriented trees for instance. New applications include the heights of some random lopsided trees and of the intersection of random trees.