The height of scaled attachment random recursive trees
From MaRDI portal
Publication:2959901
zbMATH Open1355.05222MaRDI QIDQ2959901FDOQ2959901
Authors: Omar Fawzi, Nicolas Fraiman, Luc Devroye
Publication date: 10 February 2017
Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0110
Recommendations
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05)
Cited In (4)
- Depth properties of scaled attachment random recursive trees
- Combinatorial differential operators in: Faà di Bruno formula, enumeration of ballot paths, enriched rooted trees and increasing rooted trees
- Note on the heights of random recursive trees and random m‐ary search trees
- Limit distribution of the degrees in scaled attachment random recursive trees
This page was built for publication: The height of scaled attachment random recursive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959901)