Rescaled bipartite planar maps converge to the Brownian map
Abstract
For every integer n≥ 1, we consider a random planar map Mn which is uniformly distributed over the class of all rooted bipartite planar maps with n edges. We prove that the vertex set of Mn equipped with the graph distance rescaled by the factor (2n)-1/4 converges in distribution, in the Gromov-Hausdorff sense, to the Brownian map. This complements several recent results giving the convergence of various classes of random planar maps to the Brownian map.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.