On growing random binary trees
From MaRDI portal
Publication:1076401
DOI10.1016/0022-247X(84)90141-0zbMath0593.60014OpenAlexW2093342130MaRDI QIDQ1076401
Publication date: 1984
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(84)90141-0
Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Algorithms in computer science (68W99)
Related Items (32)
Behavior near the extinction time in self-similar fragmentations. II: Finite dislocation measures. ⋮ Smoothed analysis of binary search trees ⋮ Random sequential bisection and its associated binary tree ⋮ A diffusion limit for a class of randomly-growing binary trees ⋮ A sprouting tree model for random boolean functions ⋮ On random cartesian trees ⋮ Note on the heights of random recursive trees and random m‐ary search trees ⋮ Applications of the theory of records in the study of random trees ⋮ On Random Generation of the Symmetric Group ⋮ On the joint distribution of the insertion path length and the number of comparisons in search trees ⋮ A note on the growth of random trees ⋮ The height of record‐biased trees ⋮ General Edgeworth expansions with applications to profiles of random trees ⋮ Erasure-Resilient Property Testing ⋮ Complex Burgers Equation: A Probabilistic Perspective ⋮ On the Most Probable Shape of a Search Tree Grown from a Random Permutation ⋮ Martingales and large deviations for binary search trees ⋮ On Robson's convergence and boundedness conjectures concerning the height of binary search trees ⋮ Limit laws for local counters in random binary search trees ⋮ The variance of the height of binary search trees ⋮ The height of Mallows trees ⋮ A phase transition for the heights of a fragmentation tree ⋮ On a random search tree: asymptotic enumeration of vertices by distance from leaves ⋮ The properties of random trees ⋮ The variance of the average depth of a pure birth process converges to 7 ⋮ Limiting probabilities for vertices of a given rank in 1-2 trees ⋮ Universal Limit Laws for Depths in Random Trees ⋮ Correction terms for the height of weighted recursive trees ⋮ Search problems in groups and branching processes ⋮ EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES ⋮ The height of a binary search tree: the limiting distribution perspective. ⋮ On the expected height of fringe-blanced trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limiting behavior of a process of runs
- Postulates for subadditive processes
- Subadditive ergodic theory
- Asymptotic Development of the Stirling Numbers of the First Kind
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- On the Average Shape of Binary Trees
- Percolation Processes and Related Topics
- More Combinatorial Properties of Certain Trees
- On the height of trees
- On the Distribution of the Number of Vertices in Strata of a Random Tree
- A Minimax Analogue of the Weak Law of Large Numbers
This page was built for publication: On growing random binary trees
