Local convergence of random planar graphs
Summary: The present work describes the asymptotic local shape of a graph drawn uniformly at random from all connected simple planar graphs with \(n\) labelled vertices. We establish a novel uniform infinite planar graph (UIPG) as quenched limit in the local topology as \(n \to \infty \). We also establish such limits for random \(2\)-connected planar graphs and maps as their number of edges tends to infinity. Our approach encompasses a new probabilistic view on the Tutte decomposition. This allows us to follow the path along the decomposition of connectivity from planar maps to planar graphs in a uniform way, basing each step on condensation phenomena for random walks under subexponentiality and Gibbs partitions. Using large deviation results, we recover the asymptotic formula by \textit{O. Giménez} and \textit{M. Noy} [J. Am. Math. Soc. 22, No. 2, 309--329 (2009; Zbl 1206.05019)] for the number of planar graphs.
- A Census of Planar Maps
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- A Combinatorial Decomposition Theory
- A complete grammar for decomposing a family of graphs into 3-connected components
- A course on large deviations with an introduction to Gibbs measures
- A note on conditional versus joint unconditional weak convergence in bootstrap consistency results
- A pattern of asymptotic vertex valency distributions in planar maps
- A probabilistic approach to block sizes in random maps
- A view from infinity of the uniform infinite planar quadrangulation
- An introduction to heavy-tailed and subexponential distributions
- Analytic combinatorics
- Asymptotic enumeration and limit laws of planar graphs
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Condensation in nongeneric trees
- Degree distribution in random planar graphs
- Dividing a Graph into Triconnected Components
- Functions of probability measures
- Further results on random cubic planar graphs
- Gibbs partitions: The convergent case
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Graphs on surfaces
- Growing random 3-connected maps or \textit{Comment s'enfuir de l'hexagone}
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 1146225 (Why is no real title available?)
- scientific article; zbMATH DE number 3894231 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Large deviations for random walks under subexponentiality: The big-jump domain
- Limit theorems for conditioned non-generic Galton-Watson trees
- Limits of random tree-like discrete structures
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- Local limits of large Galton-Watson trees rerooted at a random vertex
- On random planar graphs, the number of planar graphs and their triangulations
- On the degree distribution of random planar graphs
- On the diameter of random planar graphs
- On the maximal offspring in a subcritical branching process
- On the Number of Edges in Random Planar Graphs
- Pattern occurrences in random planar maps
- Percolation on uniform infinite planar maps
- Planar maps as labeled mobiles
- Random graphs from a minor-closed class
- Random graphs from a weighted minor-closed class
- Random graphs on surfaces
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- Random planar graphs
- Random planar graphs and beyond
- Random Trees
- Recurrence of bipartite planar maps
- Recurrence of planar graph limits
- Rerooting multi-type branching trees: the infinite spine case
- Scaling limits of random graphs from subcritical classes
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- The Brownian map is the scaling limit of uniform random plane quadrangulations
- The enumeration of c-nets via quadrangulations
- The maximum degree of random planar graphs
- The number of double triangles in random planar maps
- The number of labeled 2-connected planar graphs
- 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
- Recurrence of planar graph limits
- Local limits of spatial inhomogeneous random graphs
- Random cubic planar graphs converge to the Brownian sphere
- Local convergence of random planar graphs
- The uniform infinite cubic planar graph
- Local limit of the random degree constrained process
- Probabilistic enumeration and equivalence of nonisomorphic trees
This page was built for publication: Local convergence of random planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693140)
