Exposés de recherche

Collection Exposés de recherche

00:00:00 / 00:00:00
197 380

Also appears in collection : Random trees and maps: probabilistic and combinatorial aspects / Arbres et cartes aléatoires : aspects probabilistes et combinatoires

We consider the family of rooted planar maps $M_\Omega$ where the vertex degrees belong to a (possibly infinite) set of positive integers $\Omega$. Using a classical bijection with mobiles and some refined analytic tools in order to deal with the systems of equations that arise, we recover a universal asymptotic behavior of planar maps. Furthermore we establish that the number of vertices of a given degree satisfies a multi (or even infinitely)-dimensional central limit theorem. We also discuss some possible extension to maps of higher genus. This is joint work with Gwendal Collet and Lukas Klausner

Information about the video

Citation data

Bibliography

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback