Abstract: We consider the family of rooted planar maps MΩ where the vertex degrees belong to a (possibly infinite) set of positive integers Ω. 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
Recording during the thematic meeting : "Random trees and maps: probabilistic and combinatorial aspects" the June 8, 2016 at the Centre International de Rencontres Mathématiques (Marseille, France)
Filmmaker: Guillaume Hennenfent
Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities:
- Chapter markers and keywords to watch the parts of your choice in the video
- Videos enriched with abstracts, bibliographies, Mathematics Subject Classification
- Multi-criteria search by author, title, tags, mathematical area
Michael Drmota: Vertex degrees in planar maps cnrs montpellier | |
| 1 Likes | 1 Dislikes |
| 93 views views | 10K followers |
| Science & Technology | Upload TimePublished on 29 Jun 2016 |
Không có nhận xét nào:
Đăng nhận xét