On scaling limits of random Halin-like maps

DOI10.7146/MATH.SCAND.A-139930MaRDI QIDQ6366280zbMATH OpenOpenAlexFDO

Authors Daniel Amankwah, Sigurdur Örn Stefánsson

Publication date 27 April 2021

Full work available at URL https://doi.org/10.7146/math.scand.a-139930

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial probability (60C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Abstract: We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by assigning Boltzmann weights to the faces. When every vertex has exactly one marked corner, these maps are dissections of a polygon which are bijectively related to non-crossing trees. When every vertex has at least one marked corner, the maps are outerplanar and each of its two-connected component is bijectively related to a non-crossing tree. We study the scaling limits of the maps under these conditions and establish that for certain choices of the weights the scaling limits are either the Brownian CRT or the $alpha$-stable looptrees of Curien and Kortchemski.

Recommendations

• On scaling limits of random trees and maps with a prescribed degree sequence
• The scaling limit of random outerplanar maps
• On scaling limits of planar maps with stable face-degrees
• Scaling limits of random planar maps with a unique large face
• The CRT is the scaling limit of random dissections

Cited in

(1)

• Random Lévy looptrees and Lévy maps

This page was built for publication: On scaling limits of random Halin-like maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366280)