The scaling limit of random outerplanar maps
<p style="text-align:justify;"> 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 72–√/9 times Aldous’ Brownian tree. Th...
Autor principal: | Caraceni, A |
---|---|
Format: | Journal article |
Publicat: |
Institute Henri Poincaré
2016
|
Ítems similars
-
On the spread of outerplanar graphs
per: Gotshall Daniel, et al.
Publicat: (2022-03-01) -
Fuzzy Outerplanar Graphs and Its Applications
per: Deivanai Jaisankar, et al.
Publicat: (2024-09-01) -
On the number of series parallel and outerplanar graphs
per: Manuel Bodirsky, et al.
Publicat: (2005-01-01) -
Strong Chromatic Index of Outerplanar Graphs
per: Ying Wang, et al.
Publicat: (2022-04-01) -
Choosability with separation of cycles and outerplanar graphs
per: Jean-Christophe Godin, et al.
Publicat: (2023-01-01)