Vertex Degrees in Planar Maps
Combinatorics
2020-01-22 v2
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.
Cite
@article{arxiv.1605.04206,
title = {Vertex Degrees in Planar Maps},
author = {Gwendal Collet and Michael Drmota and Lukas Daniel Klausner},
journal= {arXiv preprint arXiv:1605.04206},
year = {2020}
}
Comments
16 pages typos removed, author's name corrected