Cut vertices in random planar maps

DOI10.37236/11163OpenAlexW3157135931MaRDI QIDQ6199192

Marc Noy, Benedikt Stufler, Michael Drmota

Publication date: 23 February 2024

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

Full work available at URL: https://doi.org/10.37236/11163

zbMATH Keywords

central limit theoremsubcritical classes of planar maps

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A central limit theorem for the number of degree-\(k\) vertices in random maps
• Conditional distribution of heavy tailed random variables on large deviations of their sum
• Percolation on uniform infinite planar maps
• A pattern of asymptotic vertex valency distributions in planar maps
• Root vertex valency distributions of rooted maps and rooted triangulations
• Uniform infinite planar triangulations
• Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
• Planar maps as labeled mobiles
• Scaling limits of random outerplanar maps with independent link-weights
• Recurrence of bipartite planar maps
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
• A view from infinity of the uniform infinite planar quadrangulation
• Random Trees
• A probabilistic approach to block sizes in random maps
• A Census of Planar Maps

This page was built for publication: Cut vertices in random planar maps