Limit theorems for functionals of recursive trees.
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Recommendations
- Limit theorems for depths and distances in weighted random b-ary recursive trees
- The total Steiner k-distance for b-ary recursive trees and linear recursive trees
- On tail bounds for random recursive trees
- Random recursive trees: a boundary theory approach
- Limit laws for two distance-based indices in random recursive tree models
Cited in
(11)- Limiting Distributions for Path Lengths in Recursive Trees
- Deterministic edge weights in increasing tree families
- On tail bounds for random recursive trees
- Limiting distributions for additive functionals on Catalan trees
- Limit Theorems for the Inductive Mean on Metric Trees
- Limit laws for two distance-based indices in random recursive tree models
- Note on the weighted internal path length of \(b\)-ary trees
- Random recursive trees: a boundary theory approach
- The total Steiner k-distance for b-ary recursive trees and linear recursive trees
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Limit theorems for depths and distances in weighted random b-ary recursive trees
This page was built for publication: Limit theorems for functionals of recursive trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562789)
