Branching processes in the analysis of the heights of trees
From MaRDI portal
Publication:1102045
DOI10.1007/BF00265991zbMath0643.60065OpenAlexW2008048984MaRDI QIDQ1102045
Publication date: 1987
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00265991
Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Information storage and retrieval of data (68P20) Limit theorems in probability theory (60F99)
Related Items
The profile of binary search trees ⋮ On the height of random m‐ary search trees ⋮ Depth Properties of scaled attachment random recursive trees ⋮ High degrees in recursive trees ⋮ 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 ⋮ Analytic methods in asymptotic enumeration ⋮ A note on the growth of random trees ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ The strong convergence of maximal degrees in uniform random recursive trees and dags ⋮ Hypergeometrics and the cost structure of quadtrees ⋮ Retracted: Strong limiting behavior in binary search trees ⋮ The shape of random pattern-avoiding permutations ⋮ Community modulated recursive trees and population dependent branching processes ⋮ Zip-zip trees: making zip trees more balanced, biased, compact, or persistent ⋮ Long and short paths in uniform random recursive dags ⋮ Poisson-Dirichlet branching random walks ⋮ General Edgeworth expansions with applications to profiles of random trees ⋮ Weak convergence of the number of vertices at intermediate levels of random recursive trees ⋮ Diameter of the Stochastic Mean-Field Model of Distance ⋮ Finding Adam in random growing trees ⋮ A functional limit theorem for the profile of random recursive trees ⋮ Weighted height of random trees ⋮ The height of increasing trees ⋮ Probabilistic analysis of bucket recursive trees ⋮ The Longest Minimum-Weight Path in a Complete Graph ⋮ Martingales and large deviations for binary search trees ⋮ Limiting theorems for the nodes in binary search trees ⋮ Transversals in Trees ⋮ D?E?K=(1000)8 ⋮ On Robson's convergence and boundedness conjectures concerning the height of binary search trees ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Limit laws for local counters in random binary search trees ⋮ Critical random graphs and the structure of a minimum spanning tree ⋮ A functional limit theorem for the profile of \(b\)-ary trees ⋮ The variance of the height of binary search trees ⋮ Analytic analysis of algorithms ⋮ On the internal path length ofd-dimensional quad trees ⋮ Geometry of weighted recursive and affine preferential attachment trees ⋮ A phase transition for the heights of a fragmentation tree ⋮ A non-increasing tree growth process for recursive trees and applications ⋮ Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains ⋮ 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 random k‐trees and related branching processes ⋮ The height of a binary search tree: the limiting distribution perspective. ⋮ Analytic variations on quadtrees ⋮ On the expected height of fringe-blanced trees ⋮ Limit distribution for the maximum degree of a random recursive tree
