The scaling limit of random 2-connected series-parallel maps
Authors:
Preprint
Abstract
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps with $n$ edges and show that under some integrability conditions on these weights, the maps with distances rescaled by a factor $n^{-1/2}$ converge to a constant multiple of Aldous' continuum random tree (CRT) in the Gromov--Hausdorff sense. The proof relies on a bijection between a set of trees with $n$ leaves and a set of series-parallel maps with $n$ edges, which enables one to compare geodesics in the maps and in the corresponding trees via a Markov chain argument introduced by Curien, Haas and Kortchemski (2015).
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- The skew Brownian permuton: A new universality class for random constrained permutationsProceedings of the London Mathematical Society, 2023
- The scaling limit of random outerplanar mapsAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2016
- Scaling limits of random graphs from subcritical classesThe Annals of Probability, 2016
- Scaling limits of Markov branching trees and Galton–Watson trees conditioned on the number of vertices with out-degree in a given setAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2015
- A Course on Large Deviations with an Introduction to Gibbs Measures2015
- The CRT is the scaling limit of random dissectionsRandom Structures & Algorithms, 2014
- Invariance principles for Galton–Watson trees conditioned on the number of leavesStochastic Processes and their Applications, 2012
- Simply generated trees, conditioned Galton–Watson trees, random allocations and condensationProbability Surveys, 2012
- A Course in Metric Geometry2001
- Large deviations of uniformly recurrent Markov additive processesAdvances in Applied Mathematics, 1985