Simply Generated Unrooted Plane Trees
From MaRDI portal
Publication:4626549
zbMath1406.05018arXiv1808.08140MaRDI QIDQ4626549
Leon Ramzews, Benedikt Stufler
Publication date: 28 February 2019
Full work available at URL: https://arxiv.org/abs/1808.08140
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Local limits of conditioned Galton-Watson trees: the condensation case
- Asymptotic fringe distributions for general families of random trees
- Itô's excursion theory and random trees
- Branching processes in Lévy processes: The exploration process
- Functions of probability measures
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Random enriched trees with applications to random graphs
- Recurrence of distributional limits of finite planar graphs
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Limits of random tree-like discrete structures
- Limit theorems for conditioned non-generic Galton-Watson trees
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- The continuum random tree. III
- Scaling limits of random Pólya trees
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- A Simple Proof of Duquesne’s Theorem on Contour Processes of Conditioned Galton–Watson Trees
- Scaling limits for a family of unrooted trees
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Random cutting and records in deterministic and random trees
- Random Trees
- An Introduction to Heavy-Tailed and Subexponential Distributions
- Gibbs partitions: The convergent case
- The CRT is the scaling limit of unordered binary trees
- The continuum random tree is the scaling limit of unlabeled unrooted trees
- Scaling limits of random trees and planar maps
- Scaling Limits of Markov-Branching Trees and Applications