Skip to main content Accessibility help

Limit laws of planar maps with prescribed vertex degrees

  • G. Collet (a1), M. Drmota (a1) and L. D. Klausner (a1)

We prove a generalmulti-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 possible extensions to maps of higher genus and to weighted maps.

Corresponding author
*Corresponding author. Email:
Hide All

Partially supported by the Austrian Science Fund (FWF) project SFB F50-02 ‘Shape Characteristics of Planar Maps and Planar Graphs’.

Hide All
[1] Banderier, C. and Drmota, M. (2015) Formulae and asymptotics for coefficients of algebraic functions. Combin. Probab. Comput. 24 153.
[2] Bender, E. A. and Canfield, E. R. (1986) The asymptotic number of rooted maps on a surface. J. Combin. Theory Ser. A 43 244257.
[3] Bender, E. A. and Canfield, E. R. (1993) Enumeration of degree restricted maps on the sphere. In Planar Graphs (Trotter, W. T., ed.), Vol. 9 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, pp. 1316.
[4] Bettinelli, J. (2016) A bijection for nonorientable general maps. In 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proc. BC, pp. 227238.
[5] Bouttier, J., Di Francesco, P. and Guitter, E. (2004) Planar maps as labeled mobiles. Electron. J. Combin. 11 R69.
[6] Chapuy, G. (2009) Asymptotic enumeration of constellations and related families of maps on orientable surfaces. Combin. Probab. Comput. 18 477516.
[7] Chapuy, G. and Dołȩga, M. (2017) A bijection for rooted maps on general surfaces. J. Combin. Theory Ser. A 145 252307.
[8] Chapuy, G., Fusy, É., Kang, M. and Shoilekova, B. (2008) A complete grammar for decomposing a family of graphs into 3-connected components. Electron. J. Combin. 15 R148.
[9] Chapuy, G., Marcus, M. and Schaeffer, G. (2009) A bijection for rooted maps on orientable surfaces. SIAM J. Discrete Math 23 15871611.
[10] Collet, G. and Fusy, É. (2012) A simple formula for the series of bipartite and quasi-bipartite maps with boundaries. In 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), DMTCS Proc. AR, pp. 607618.
[11] Drmota, M. (2009) Random Trees: An Interplay Between Combinatorics and Probability, Springer.
[12] Drmota, M., Gittenberger, B. and Morgenbesser, J. F. (2012) Infinite systems of functional equations and Gaussian limiting distributions. In 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods in the Analysis of Algorithms (AofA ’12), DMTCS Proc. AQ, pp. 453478.
[13] Drmota, M. and Panagiotou, K. (2013) A central limit theorem for the number of degree-k vertices in random maps. Algorithmica 66 741761.
[14] Marckert, J.-F. andMiermont, G. (2007) Invariance principles for random bipartite planar maps. Ann. Probab. 35 16421705.
[15] Miermont, G. and Weil, M. (2008) Radius and profile of random planar maps with faces of arbitrary degrees. Electron. J. Probab. 13 #4, 79106.
[16] Tutte, W. T. (1963) A census of planar maps. Canad. J. Math. 15 249271.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

MSC classification


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed