Protected nodes and fringe subtrees in some random trees
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Limit laws for functions of fringe trees for binary search trees and random recursive treesElectronic Journal of Probability, 2015
- Simply generated trees, conditioned Galton–Watson trees, random allocations and condensationProbability Surveys, 2012
- Protected points in k-ary treesApplied Mathematics Letters, 2011
- Protected points in ordered treesApplied Mathematics Letters, 2008
- Limit Laws for Sums of Functions of Subtrees of Random Binary Search TreesSIAM Journal on Computing, 2002
- A Random Walk Approach to Galton–Watson TreesJournal of Theoretical Probability, 2000
- Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms1998
- Asymptotic Fringe Distributions for General Families of Random TreesThe Annals of Applied Probability, 1991