Simply generated unrooted plane trees
From MaRDI portal
Abstract: We study random unrooted plane trees with vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this model of random trees may be approximated geometrically by a Galton--Watson tree conditioned on having a large random size. This implies that a variety of results for the well-studied planted case also hold for unrooted trees, including Gromov--Hausdorff--Prokhorov scaling limits, tail-bounds for the diameter, distributional graph limits, and limits for the maximum degree. Our work complements results by Wang~(2016), who studied random unrooted plane trees whose diameter tends to infinity.
Recommendations
- Scaling limits for a family of unrooted trees
- The continuum random tree is the scaling limit of unlabeled unrooted trees
- The distance profile of rooted and unrooted simply generated trees
- Random enriched trees with applications to random graphs
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
Cites work
- A course in metric geometry
- A limit theorem for the contour process of conditioned Galton-Watson trees
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees
- An introduction to heavy-tailed and subexponential distributions
- Analytic combinatorics
- Asymptotic fringe distributions for general families of random trees
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Branching processes in Lévy processes: The exploration process
- Functions of probability measures
- Generatingfunctionology
- Gibbs partitions: The convergent case
- scientific article; zbMATH DE number 3426516 (Why is no real title available?)
- scientific article; zbMATH DE number 3978019 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3894231 (Why is no real title available?)
- Itô's excursion theory and random trees
- Limit theorems for conditioned non-generic Galton-Watson trees
- Limits of random tree-like discrete structures
- Local limits of conditioned Galton-Watson trees: the condensation case
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- Random cutting and records in deterministic and random trees
- Random enriched trees with applications to random graphs
- Random Trees
- Recurrence of distributional limits of finite planar graphs
- Scaling limits for a family of unrooted trees
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Scaling Limits of Markov-Branching Trees and Applications
- Scaling limits of random Pólya trees
- Scaling limits of random trees and planar maps
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- The continuum random tree is the scaling limit of unlabeled unrooted trees
- The continuum random tree. III
- The CRT is the scaling limit of unordered binary trees
- Voronoi tessellations in the CRT and continuum random maps of finite excess
Cited in
(3)
This page was built for publication: Simply generated unrooted plane trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626549)
