A non-increasing tree growth process for recursive trees and applications
From MaRDI portal
Publication:4993121
DOI10.1017/S0963548320000073zbMath1469.60042arXiv1701.01656MaRDI QIDQ4993121
Publication date: 15 June 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.01656
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coalescent processes (60J90)
Related Items (2)
Depth of vertices with high degree in random recursive trees ⋮ On joint properties of vertices with a given degree or label in the random recursive tree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching processes in the analysis of the heights of trees
- Coalescent random forests
- On Strassen's theorem on stochastic domination
- Limit distribution for the maximum degree of a random recursive tree
- Limit theorems for patterns in phylogenetic trees
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Distribution of nodes of a tree by degree
- Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
- Note on the heights of random recursive trees and random m‐ary search trees
- High degrees in random recursive trees
- Asymptotic degree distribution in random recursive trees
- Balls and bins: A study in negative dependence
- Building uniformly random subtrees
- The strong convergence of maximal degrees in uniform random recursive trees and dags
- Extreme value theory for a class of discrete distributions with applications to some stochastic processes
This page was built for publication: A non-increasing tree growth process for recursive trees and applications