Random enriched trees with applications to random graphs
From MaRDI portal
Abstract: We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random unlabelled -trees that are rooted at a -clique of distinguishable vertices. For both models we establish a Gromov--Hausdorff scaling limit, a Benjamini--Schramm limit, and a local weak limit that describes the asymptotic shape near the fixed root.
Recommendations
Cites work
- scientific article; zbMATH DE number 3830171 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 54001 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A Generalization of the Ballot Problem and its Application in the Theory of Queues
- A course in metric geometry
- A limit theorem for the contour process of conditioned Galton-Watson trees
- A view from infinity of the uniform infinite planar quadrangulation
- An asymptotic analysis of labeled and unlabeled k-trees
- Analytic combinatorics
- Asymptotic Enumeration of Spanning Trees
- Asymptotic fringe distributions for general families of random trees
- Asymptotic study of subcritical graph classes
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Chernoff-type bound for finite Markov chains
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
- Counting unlabeled \(k\)-trees
- Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
- Enumerating k-trees
- Enumeration and asymptotic properties of unlabeled outerplanar graphs
- Enumeration of non-separable graphs
- Extremal Parameters in Sub-Critical Graph Classes
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Graph theory
- Joint convergence of random quadrangulations and their cores
- Limiting distribution for distances in \(k\)-trees
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- Local limit of labeled trees and expected volume growth in a random quadrangulation
- On the diameter of random planar graphs
- Percolation on uniform infinite planar maps
- Probabilistic and fractal aspects of Lévy trees
- Random Trees
- Random cutting and records in deterministic and random trees
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Recurrence of bipartite planar maps
- 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 k-ary growing trees
- Scaling limits of random Pólya trees
- Scaling limits of random graphs from subcritical classes
- Scaling limits of random planar maps with a unique large face
- Scaling limits of random trees and planar maps
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- The Brownian map is the scaling limit of uniform random plane quadrangulations
- The Brownian plane with minimal neck baby universe
- The CRT is the scaling limit of unordered binary trees
- The continuum random tree. I
- The continuum random tree. III
- The degree distribution in unlabelled 2-connected graph families
- The number of labeled k-dimensional trees
- The number of labeled k-trees
- The specification of 2-trees
- The topological structure of scaling limits of large planar maps
- Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
- Une théorie combinatoire des séries formelles
- Uniform infinite planar triangulations
- Uniqueness and universality of the Brownian map
- Vertex degrees in planar maps
- \(\Gamma \)-species and the enumeration of \(k\)-trees
Cited in
(15)- Asymptotic enumeration and limit laws for multisets: the subexponential case
- Limits of random tree-like discrete structures
- Asymptotic properties of random unlabelled block-weighted graphs
- Scaling Limits of Markov-Branching Trees and Applications
- Graph limits of random unlabelled k-trees
- Rerooting multi-type branching trees: the infinite spine case
- Decorated stable trees
- Exact-Size Sampling of Enriched Trees in Linear Time
- On large‐girth regular graphs and random processes on trees
- A branching process approach to level‐k phylogenetic networks
- Graphon convergence of random cographs
- Simply generated unrooted plane trees
- A decorated tree approach to random permutations in substitution-closed classes
- Graph limits of random graphs from a subset of connected \(k\)-trees
- Speeding up non-Markovian first-passage percolation with a few extra edges
This page was built for publication: Random enriched trees with applications to random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1658748)
