High degrees in recursive trees
From MaRDI portal
Publication:324889
DOI10.1016/j.endm.2015.07.075zbMath1347.05228OpenAlexW2205735485MaRDI QIDQ324889
Louigi Addario-Berry, Laura Eslava
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.075
Analysis of algorithms (68W40) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Branching processes in the analysis of the heights of trees
- Limit distribution for the maximum degree of a random recursive tree
- Distribution of nodes of a tree by degree
- Recent progress in coalescent theory
- Random Trees
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Note on the heights of random recursive trees and random m‐ary search trees
- Asymptotic degree distribution in random recursive trees
- The strong convergence of maximal degrees in uniform random recursive trees and dags
- An Introduction to the Theory of Point Processes