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...
Main Author: | Caraceni, A |
---|---|
Format: | Journal article |
Published: |
Institute Henri Poincaré
2016
|
Similar Items
-
On the spread of outerplanar graphs
by: Gotshall Daniel, et al.
Published: (2022-03-01) -
On the number of series parallel and outerplanar graphs
by: Manuel Bodirsky, et al.
Published: (2005-01-01) -
Strong Chromatic Index of Outerplanar Graphs
by: Ying Wang, et al.
Published: (2022-04-01) -
The Degree-Diameter Problem for Outerplanar Graphs
by: Dankelmann Peter, et al.
Published: (2017-08-01) -
Choosability with separation of cycles and outerplanar graphs
by: Jean-Christophe Godin, et al.
Published: (2023-01-01)