A functional limit theorem for the profile of search trees

From MaRDI portal
Publication:2476407

DOI10.1214/07-AAP457zbMath1143.68019arXivmath/0609385MaRDI QIDQ2476407

Svante Janson, Ralph Neininger, Michael Drmota

Publication date: 19 March 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0609385



Related Items

Limit Theorems for Subtree Size Profiles of Increasing Trees, Pólya Urns Via the Contraction Method, Higher moments of Banach space valued random variables, A limit process for partial match queries in random quadtrees and 2-d trees, Continuous-time digital search tree and a border aggregation model, Edgeworth expansions for profiles of lattice branching random walks, Long and short paths in uniform random recursive dags, Shape Measures of Random Increasing k-trees, General Edgeworth expansions with applications to profiles of random trees, The degree profile of random Pólya trees, Weak convergence of the number of vertices at intermediate levels of random recursive trees, Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations, Process convergence for the complexity of radix selection on Markov sources, Heavy tailed solutions of multivariate smoothing transforms, Refined asymptotics for the composition of cyclic urns, A functional limit theorem for the profile of random recursive trees, Search trees: metric aspects and strong limit theorems, Dependence and phase changes in random m‐ary search trees, On martingale tail sums for the path length in random trees, On the Subtree Size Profile of Binary Search trees, A functional limit theorem for the profile of \(b\)-ary trees, Refined quicksort asymptotics, Partial match queries in random quadtrees, Limit theorems for patterns in phylogenetic trees, On a functional contraction method



Cites Work