The Scaling Limit of Random Outerplanar Maps
Abstract
A planar map is outerplanar if all its vertices belong to the same face. We show that random uniform outerplanar maps with n vertices suitably rescaled by a factor 1/ n converge in the Gromov-Hausdorff sense to 7 29 times Aldous' Brownian tree. The proof uses the bijection of Bonichon, Gavoille and Hanusse.
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.