Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees

TL;DR

This survey explores the asymptotic behavior of fringe trees in various random tree models, including m-ary search trees, using Crump-Mode-Jagers branching processes, and introduces new results on properties like protected nodes.

Contribution

It provides a comprehensive analysis of fringe trees in diverse random trees, with new detailed results on m-ary search trees and their properties.

Findings

New results on fringe trees of m-ary search trees

Analysis of degree distribution and protected nodes

Survey of height and path length in random trees

Abstract

This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive trees, preferential attachment trees, fragmentation trees, binary search trees and (more generally) $m$-ary search trees, as well as some other classes of random trees. We begin with general results, mainly due to Aldous (1991) and Jagers and Nerman (1984). The general results are applied to fringe trees and extended fringe trees for several particular types of random trees, where the theory is developed in detail. In particular, we consider fringe trees of $m$-ary search trees in detail; this seems to be new. Various applications are given, including degree distribution, protected nodes and maximal clades for various types of random trees. Again, we emphasise results for $m$-ary search trees, and give for example new results on protected nodes in $m$-ary search trees. A separate section surveys results on height, saturation level, typical depth and total path length, due to Devroye (1986), Biggins (1995, 1997) and others. This survey contains well-known basic results together with some additional general results as well as many new examples and applications for various classes of random trees.