Limits of random trees
From MaRDI portal
Abstract: Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the probability of a given tree is proportional to . We show that this sequence is convergent and describe the limit object, which is a random infinite rooted tree.
Recommendations
Cites work
Cited in
(20)- Limit distribution for the maximum degree of a random recursive tree
- Random enriched trees with applications to random graphs
- Trees and generalised inverse limits on intervals
- Limit distributions and random trees derived from the birthday problem with unequal probabilities
- Random tree-weighted graphs
- On a tail bound for analyzing random trees
- Limits of random tree-like discrete structures
- Limits of random trees. II
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Modeling limits in hereditary classes: reduction and application to trees
- Convergence and limits of finite trees
- Limit theorems for random trees.
- And/or trees: A local limit point of view
- Probability bounds given by hypercherry trees
- Normal Limit Law for Protected Node Profile of Random Recursive Trees
- Graph limits of random graphs from a subset of connected k-trees
- Tree limits and limits of random trees
- scientific article; zbMATH DE number 7703245 (Why is no real title available?)
- On the limit of large girth graph sequences
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
This page was built for publication: Limits of random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250844)