The Hitting Time for the Height of a Random Recursive Tree
From MaRDI portal
(Redirected from Publication:3608339)
Recommendations
- On hitting times of random walks on trees
- The height of depth-weighted random recursive trees
- On the distribution of random walk hitting times in random trees
- Extremal hitting times of trees with some given parameters
- On the moments of hitting times for random walks on trees
- The generating functions of hitting times for random walk on trees
- On tail bounds for random recursive trees
- The height of random k‐trees and related branching processes
- scientific article; zbMATH DE number 17686
- Note on the heights of random recursive trees and random m‐ary search trees
Cites work
- A Probability Model of a Pyramid Scheme
- A strong law for the height of random binary pyramids
- Applications of the theory of records in the study of random trees
- Asymptotic degree distribution in random recursive trees
- Breakage and restoration in recursive trees
- Climbing certain types of rooted trees. II
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- On the distribution of distances in recursive trees
- On the distribution of leaves in rooted subtrees of recursive trees
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- Review of the stirling numbers, their generalizations and Statistical Applications
- Stirling Behavior is Asymptotically Normal
- The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
- Uniform recursive trees: branching structure and simple random downward walk
This page was built for publication: The Hitting Time for the Height of a Random Recursive Tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608339)
