Random Structures & Algorithms
Note on the heights of random recursive trees and random m‐ary search trees
Random Structures & Algorithms
| Hi-index | 0.04 |
We examine a random structure consisting of objects with positive weights and evolving in discrete time steps. It generalizes certain random graph models. We prove almost sure convergence for the weight distribution and show scale-free asymptotic behaviour. Martingale theory and renewal-like equations are used in the proofs.