Results 1 
7 of
7
A functional limit theorem for the profile of search trees
 Annals of Applied Probability
, 2008
"... We study the profile Xn,k of random search trees including binary search trees and mary search trees. Our main result is a functional limit theorem of the normalized profile Xn,k/EXn,k for k =⌊α log n ⌋ in a certain range of α. A central feature of the proof is the use of the contraction method to ..."
Abstract

Cited by 21 (11 self)
 Add to MetaCart
We study the profile Xn,k of random search trees including binary search trees and mary search trees. Our main result is a functional limit theorem of the normalized profile Xn,k/EXn,k for k =⌊α log n ⌋ in a certain range of α. A central feature of the proof is the use of the contraction method to prove convergence in distribution of certain random analytic functions in a complex domain. This is based on a general theorem concerning the contraction method for random variables in an infinitedimensional Hilbert space. As part of the proof, we show that the Zolotarev metric is complete for a Hilbert space. 1. Introduction. Search
Profiles of random trees: correlation and width of random recursive trees and binary search trees
 ADVANCES IN APPLIED PROBABILITY
, 2004
"... We derive asymptotic approximations to the correlation coefficients of two level sizes in random recursive trees and binary search trees, which undergo sharp signchanges when one level is fixed and the other one is varying. An asymptotic estimate for the expected width is also derived. ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
We derive asymptotic approximations to the correlation coefficients of two level sizes in random recursive trees and binary search trees, which undergo sharp signchanges when one level is fixed and the other one is varying. An asymptotic estimate for the expected width is also derived.
Profiles of random trees: Limit theorems for random recursive trees and binary search trees
, 2005
"... We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio ˛ of the level and the logarithm of tree size lies in Œ0; e/. Convergence of all moments is shown to hold only for ˛ 2 Œ0; 1 (with only con ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio ˛ of the level and the logarithm of tree size lies in Œ0; e/. Convergence of all moments is shown to hold only for ˛ 2 Œ0; 1 (with only convergence of finite moments when ˛ 2.1; e/). When the limit ratio is 0 or 1 for which the limit laws are both constant, we prove asymptotic normality for ˛ D 0 and a “quicksort type ” limit law for ˛ D 1, the latter case having additionally a small range where there is no fixed limit law. Our tools are based on contraction method and method of moments. Similar phenomena also hold for other classes of trees; we apply our tools to binary search trees and give a complete characterization of the profile. The profiles of these random trees represent concrete examples for which the range of convergence in distribution differs from that of convergence of all moments.
The random multisection problem, travelling waves, and the distribution of the height of mary search trees
 Algorithmica
, 2006
"... The purpose of this article is to show that the distribution of the longest fragment in the random multisection problem after k steps and the height of mary search trees (and some extensions) are not only closely related in a formal way but both can be asymptotically described with the same distrib ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The purpose of this article is to show that the distribution of the longest fragment in the random multisection problem after k steps and the height of mary search trees (and some extensions) are not only closely related in a formal way but both can be asymptotically described with the same distribution function that has to be shifted in a proper way (travelling wave). The crucial property for the proof is a socalled intersection property that transfers inequalities between two distribution functions (resp. of their Laplace transforms) from one level to the next. It is conjectured that such intersection properties hold in a much more general context. If this property is verified convergence to a travelling wave follows almost automatically.
Contents
"... 1 Arbres et booléens 2 1.1 Le modèle des abr pour les expressions booléennes............... 2 1.2 La méthode du plongement en temps continu appliquée à l’abr........ 3 1.3 Une urne de Pólya cachée dans un arbre d’implication............. 4 ..."
Abstract
 Add to MetaCart
1 Arbres et booléens 2 1.1 Le modèle des abr pour les expressions booléennes............... 2 1.2 La méthode du plongement en temps continu appliquée à l’abr........ 3 1.3 Une urne de Pólya cachée dans un arbre d’implication............. 4