Limits of random tree-like discrete structures
From MaRDI portal
Publication:2192232
DOI10.1214/19-PS338zbMath1454.60019arXiv1612.02580OpenAlexW3047294912MaRDI QIDQ2192232
Publication date: 14 August 2020
Published in: Probability Surveys (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.02580
Related Items (17)
Quenched local convergence of Boltzmann planar maps ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Graphon convergence of random cographs ⋮ Longest and shortest cycles in random planar graphs ⋮ A branching process with coalescence to model random phylogenetic networks ⋮ A phase transition in block-weighted random maps ⋮ Random cubic planar graphs converge to the Brownian sphere ⋮ Decorated stable trees ⋮ On random trees and forests ⋮ On the maximal offspring in a subcritical branching process ⋮ Local convergence of random planar graphs ⋮ The boundary of random planar maps via looptrees ⋮ Simply Generated Unrooted Plane Trees ⋮ Graph limits of random unlabelled k-trees ⋮ A decorated tree approach to random permutations in substitution-closed classes ⋮ Universal height and width bounds for random trees
Cites Work
- UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
- Extremal Parameters in Sub-Critical Graph Classes
- Graph limits of random graphs from a subset of connected k‐trees
- Scaling limits of random trees and planar maps
- A Relationship between Two Sequences Iii
- The number of labeled k-dimensional trees
- The number of labeled k-trees
- Enumeration of non-separable graphs
- Asymptotic Enumeration of Spanning Trees
- Probability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning trees in random series-parallel graphs
- 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
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Growing random 3-connected maps or \textit{Comment s'enfuir de l'hexagone}
- The scaling limit of random outerplanar maps
- Degree distribution in random planar graphs
- Scaling limits of random planar maps with large faces
- Condensation in nongeneric trees
- On properties of random dissections and triangulations
- On intrinsic geometry of surfaces in normed spaces
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- The specification of 2-trees
- Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case
- Random graphs from a block-stable class
- Local limits of conditioned Galton-Watson trees: the condensation case
- 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
- Large deviations for random walks under subexponentiality: The big-jump domain
- Growth constants of minor-closed classes of graphs
- Enumeration and asymptotic properties of unlabeled outerplanar graphs
- Ends in uniform spanning forests
- 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
- Choosing a spanning tree for the integer lattice uniformly
- Tree-valued Markov chains derived from Galton-Watson processes
- Schröder parenthesizations and chordates
- Functions of probability measures
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Uniform infinite planar triangulations
- Logarithmic combinatorial structures: A probabilistic approach
- When structures are almost surely connected
- Random enriched trees with applications to random graphs
- Joint convergence of random quadrangulations and their cores
- Local limits of large Galton-Watson trees rerooted at a random vertex
- Mixing times for random walks on finite lamplighter groups
- Random combinatorial structures: the convergent case
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Planar maps as labeled mobiles
- Probabilistic and fractal aspects of Lévy trees
- Recurrence of distributional limits of finite planar graphs
- Uniform spanning forests
- Recurrence of planar graph limits
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- \(\Gamma \)-species and the enumeration of \(k\)-trees
- Classification of scaling limits of uniform quadrangulations with a boundary
- Limit theorems for conditioned non-generic Galton-Watson trees
- Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
- Random walk on random infinite looptrees
- Scaling limits of random planar maps with a unique large face
- Scaling limits of random outerplanar maps with independent link-weights
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- The continuum random tree. III
- The topological structure of scaling limits of large planar maps
- Random stable laminations of the disk
- Recurrence of bipartite planar maps
- Local limit of labeled trees and expected volume growth in a random quadrangulation
- Enumerating k-trees
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
- Trees and spatial topology change in CDT
- A Simple Proof of Duquesne’s Theorem on Contour Processes of Conditioned Galton–Watson Trees
- A view from infinity of the uniform infinite planar quadrangulation
- Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
- Planar Maps are Well Labeled Trees
- Asymptotic enumeration and limit laws of planar graphs
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Random trees with superexponential branching weights
- The CRT is the scaling limit of random dissections
- Asymptotic Study of Subcritical Graph Classes
- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
- On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
- The Degree Sequence of Random Graphs from Subcritical Classes
- Random Graphs from a Minor-Closed Class
- Limiting Distribution for Distances in k-Trees
- A Generalization of the Ballot Problem and its Application in the Theory of Queues
- The Galton-Watson process conditioned on the total progeny
- Subgraph statistics in subcritical graph classes
- A probabilistic approach to block sizes in random maps
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Building uniformly random subtrees
- Gibbs partitions: The convergent case
This page was built for publication: Limits of random tree-like discrete structures
