Vertex degrees in planar maps

MaRDI QIDQ4632475zbMATH OpenFDO

Authors Gwendal Collet, Michael Drmota, Lukas Daniel Klausner

Publication date 29 April 2019

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

zbMATH Keywords

analytic combinatoricscentral limit theoremmobilesplanar maps

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10)

Abstract: We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with refined analytic tools to deal with the systems of equations on infinite variables that arise. We also discuss some possible extension to maps of higher genus.

Recommendations

• Limit laws of planar maps with prescribed vertex degrees
• A central limit theorem for the number of degree-\(k\) vertices in random maps
• A central limit theorem for the number of degree-\(k\) vertices in random maps
• scientific article; zbMATH DE number 6297799
• The distribution of the maximum vertex degree in random planar maps

Cited in

(8)

• Random enriched trees with applications to random graphs
• Pattern occurrences in random planar maps
• Universal exponents and tail estimates in the enumeration of planar maps
• Note on vertex degrees of planar graphs
• A central limit theorem for the number of degree-\(k\) vertices in random maps
• A central limit theorem for the number of degree-\(k\) vertices in random maps
• Limit laws of planar maps with prescribed vertex degrees
• On triangulations with high vertex degree

This page was built for publication: Vertex degrees in planar maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632475)