The height of increasing trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3791336 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1246231 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 3410334 (Why is no real title available?)
- On the Altitude of Nodes in Random Trees
Cited in
(18)- Bivariate Markov chains converging to Lamperti transform Markov additive processes
- A bijection of plane increasing trees with relaxed binary trees of right height at most one
- Scaling limits of multi-type Markov branching trees
- The height of Mallows trees
- Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
- On tail bounds for random recursive trees
- Analysis of statistics for generalized Stirling permutations
- Random recursive trees and preferential attachment trees are random split trees
- Tree limits and limits of random trees
- The height of increasing trees
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments
- The height of record‐biased trees
- Scaling Limits of Markov-Branching Trees and Applications
- Models of random subtrees of a graph
- The total path length of split trees
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Increasing paths in regular trees
- Weighted height of random trees
This page was built for publication: The height of increasing trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900175)