Limiting probabilities for vertices of a given rank in 1-2 trees
From MaRDI portal
Publication:2323818
zbMath1419.05043arXiv1803.05033MaRDI QIDQ2323818
Publication date: 12 September 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.05033
Trees (05C05) Exact enumeration problems, generating functions (05A15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (3)
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves ⋮ The lemniscate tree of a random polynomial ⋮ Troupes, cumulants, and stack-sorting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-protected vertices in binary search trees
- Notes on protected nodes in digital search trees
- Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
- Moment of degeneration of a branching process and height of a random tree
- Asymptotic distribution of two-protected nodes in random binary search trees
- Protected nodes and fringe subtrees in some random trees
- On growing random binary trees
- Symbolic integration. I: Transcendental functions
- \(k\)-protected vertices in unlabeled rooted plane trees
- On the log-convexity of combinatorial sequences
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- Note on the heights of random recursive trees and random m‐ary search trees
- A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree
- Protection number in plane trees
- On a random search tree: asymptotic enumeration of vertices by distance from leaves
- Asymptotic Properties of Protected Nodes in Random Recursive Trees
This page was built for publication: Limiting probabilities for vertices of a given rank in 1-2 trees
