arXiv Analytics

Sign in

arXiv:1310.0665 [math.PR]AbstractReferencesReviewsResources

Protected nodes and fringe subtrees in some random trees

Luc Devroye, Svante Janson

Published 2013-10-02Version 1

We study protected nodes in various classes of random rooted trees by putting them in the general context of fringe subtrees introduced by Aldous (1991). Several types of random trees are considered: simply generated trees (or conditioned Galton-Watson trees), which includes several cases treated separately by other authors, binary search trees and random recursive trees. This gives unified and simple proofs of several earlier results, as well as new results.

Related articles: Most relevant | Search more
arXiv:2403.03151 [math.PR] (Published 2024-03-05)
Binary search trees of permuton samples
arXiv:1611.01306 [math.PR] (Published 2016-11-04)
Scaling limits for some random trees constructed inhomogeneously
arXiv:2211.12801 [math.PR] (Published 2022-11-23)
The distribution of the number of automorphisms of random trees