arXiv Analytics

Sign in

arXiv:math/0607119 [math.PR]AbstractReferencesReviewsResources

Width and mode of the profile for some random trees of logarithmic height

Luc Devroye, Hsien-Kuei Hwang

Published 2006-07-05Version 1

We propose a new, direct, correlation-free approach based on central moments of profiles to the asymptotics of width (size of the most abundant level) in some random trees of logarithmic height. The approach is simple but gives precise estimates for expected width, central moments of the width and almost sure convergence. It is widely applicable to random trees of logarithmic height, including recursive trees, binary search trees, quad trees, plane-oriented ordered trees and other varieties of increasing trees.

Comments: Published at http://dx.doi.org/10.1214/105051606000000187 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Journal: Annals of Applied Probability 2006, Vol. 16, No. 2, 886-918
Categories: math.PR
Subjects: 60C05, 05C05, 68P10
Related articles: Most relevant | Search more
arXiv:2403.03151 [math.PR] (Published 2024-03-05)
Binary search trees of permuton samples
arXiv:1310.0665 [math.PR] (Published 2013-10-02)
Protected nodes and fringe subtrees in some random trees
arXiv:2005.13832 [math.PR] (Published 2020-05-28)
Tree limits and limits of random trees