Tree limits and limits of random trees
arXiv:2005.13832 · doi:10.1017/S0963548321000055
Abstract
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees, for split trees and generalized split trees (as defined here), and for trees defined by a continuous-time branching process. These general results include, for example, random labelled trees, ordered trees, random recursive trees, preferential attachment trees, and binary search trees.
arXiv comment50 pages
References in corpus (9)
- Random trees and applications
- Graph limits and exchangeable random graphs
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Condensation in nongeneric trees
- Cutting down trees with a Markov chainsaw
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Spanning tree size in Random Binary Search Trees
- Random trees with superexponential branching weights
- On the Gromov-Prohorov distance