ENS, France

We discuss the convergence in distribution of rescaled random planar maps viewed as random metric spaces. More precisely, we consider a random planar map M(n), which is uniformly distributed over the set of all planar maps with n faces in a certain class. We equip the set of vertices of M(n) with the graph distance rescaled by the factor n to the power 1/4. We then discuss the convergence in distribution of the resulting random metric spaces as n tends to infinity, in the sense of the Gromov-Hausdorff distance between compact metric spaces. This problem was stated by Oded Schramm in his plenary address paper at the 2006 ICM, in the special case of triangulations.

In the case of bipartite planar maps, we first establish a compactness result showing that a limit exists along a suitable subsequence. Furthermore this limit can be written as a quotient space of the Continuum Random Tree (CRT) for an equivalence relation which has a simple definition in terms of Brownian labels attached to the vertices of the CRT. Finally we show that any possible limiting metric space is almost surely homomorphic to the 2-sphere. As a key tool, we use bijections between planar maps and various classes of labelled trees.