University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Blossoming trees and the scaling limit of maps

Blossoming trees and the scaling limit of maps

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Random Geometry

Co-authors: Louigi Addario-Berry (Mc Gill University), Olivier Bernardi (Brandeis University), Gwendal Collet (TU Wien), ric Fusy (CNRS), Dominique Poulalhon (Universit Paris 7)

In the last years, numerous families of planar maps have been shown to converge to the Brownian map introduced by Miermont and Le Gall. Most of these results rely on some bijections with labeled trees mobiles due to Schaeffer and Bouttier, di Francesco and Guitter.

In this talk, I’ll present another class of bijections between so-called blossoming trees and maps. These bijections have been established 15 years ago but it is not since only recently that we managed to use them to track down the distances in the maps as a function of the trees. This link relies on some canonical leftmost paths , which behave well both in the map and in the tree.

As an example of the possible outcomes of these bijections, I’ll prove that the scaling limit of simple maps (that is maps without loops nor multiple edges) is also the Brownian map. I’ll emphasize the combinatorial construction which lies at the heart of this proof.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity