Random enriched trees with applications to random graphs

zbMath1393.60013arXiv1504.02006MaRDI QIDQ1658748

Benedikt Stufler

Publication date: 15 August 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.02006

zbMATH Keywords

random graphssymmetriesscaling limitslocal weak limits

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (13)

Rerooting multi-type branching trees: the infinite spine case ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Graphon convergence of random cographs ⋮ Limits of random tree-like discrete structures ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Decorated stable trees ⋮ Speeding up non-Markovian first-passage percolation with a few extra edges ⋮ Simply Generated Unrooted Plane Trees ⋮ Graph limits of random unlabelled k-trees ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ A decorated tree approach to random permutations in substitution-closed classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An asymptotic analysis of labeled and unlabeled \(k\)-trees
• Scaling limits of random graphs from subcritical classes
• Uniqueness and universality of the Brownian map
• The Brownian map is the scaling limit of uniform random plane quadrangulations
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Scaling limits of random planar maps with large faces
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The specification of 2-trees
• Percolation on uniform infinite planar maps
• The continuum random tree. I
• Asymptotic fringe distributions for general families of random trees
• Scaling limits of \(k\)-ary growing trees
• Enumeration and asymptotic properties of unlabeled outerplanar graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• Une théorie combinatoire des séries formelles
• Chernoff-type bound for finite Markov chains
• A limit theorem for the contour process of conditioned Galton-Watson trees
• Uniform infinite planar triangulations
• Joint convergence of random quadrangulations and their cores
• Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
• Probabilistic and fractal aspects of Lévy trees
• Recurrence of distributional limits of finite planar graphs
• Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
• \(\Gamma \)-species and the enumeration of \(k\)-trees
• Scaling limits of random planar maps with a unique large face
• The continuum random tree. III
• The topological structure of scaling limits of large planar maps
• Scaling limits of random Pólya trees
• Recurrence of bipartite planar maps
• Counting unlabeled \(k\)-trees
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Local limit of labeled trees and expected volume growth in a random quadrangulation
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
• Enumerating k-trees
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• A view from infinity of the uniform infinite planar quadrangulation
• Scaling limits for a family of unrooted trees
• On the diameter of random planar graphs
• Boltzmann Samplers, Pólya Theory, and Cycle Pointing
• Asymptotic Study of Subcritical Graph Classes
• Random cutting and records in deterministic and random trees
• Random Trees
• Limiting Distribution for Distances in k-Trees
• A Generalization of the Ballot Problem and its Application in the Theory of Queues
• The Brownian plane with minimal neck baby universe
• Vertex Degrees in Planar Maps
• Extremal Parameters in Sub-Critical Graph Classes
• Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees
• The CRT is the scaling limit of unordered binary trees
• Scaling limits of random trees and planar maps
• The number of labeled k-dimensional trees
• The number of labeled k-trees
• Enumeration of non-separable graphs
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Random enriched trees with applications to random graphs