Total Path Length for Random Recursive Trees
From MaRDI portal
Publication:4719431
DOI10.1017/S0963548399003855zbMath0946.05077MaRDI QIDQ4719431
James Allen Fill, Robert P. Dobrow
Publication date: 23 October 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) (L^p)-limit theorems (60F25)
Related Items (19)
Limit laws for partial match queries in quadtrees ⋮ On leaf related statistics in recursive tree models ⋮ Depth Properties of scaled attachment random recursive trees ⋮ Cost distribution of the Chang-Roberts leader election algorithm and related problems ⋮ Profile of random exponential recursive trees ⋮ Limit laws for two distance-based indices in random recursive tree models ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ On densities for solutions to stochastic fixed point equations ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ Unnamed Item ⋮ Cost functionals for large (uniform and simply generated) random trees ⋮ The total path length of split trees ⋮ Asymptotic Analysis of Hoppe Trees ⋮ On martingale tail sums for the path length in random trees ⋮ Combinatorial Analysis of Growth Models for Series-Parallel Networks ⋮ On the shape of the fringe of various types of random trees ⋮ Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees ⋮ Limit distribution for the maximum degree of a random recursive tree
This page was built for publication: Total Path Length for Random Recursive Trees
