Sénizergues, D., Stefánsson, S. Ö., & Stufler, B. (2023). Decorated stable trees. Electronic Journal of Probability, 28, Article 149. https://doi.org/10.1214/23-EJP1050
E104-05 - Forschungsbereich Kombinatorik und Algorithmen
-
Journal:
Electronic Journal of Probability
-
ISSN:
1083-6489
-
Date (published):
2023
-
Number of Pages:
54
-
Publisher:
INST MATHEMATICAL STATISTICS-IMS
-
Peer reviewed:
Yes
-
Keywords:
decorated trees; invariance principle; looptrees; self-similarity; stable trees
en
Abstract:
We define decorated α-stable trees which are informally obtained from an α-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the α-stable looptrees of Curien and Kortchemski, where those metric spaces are just deterministic circles. We provide different constructions for these objects, which allows us to understand some of their geometric properties, including compactness, Hausdorff dimension and self-similarity in distribution. We prove an invariance principle which states that under some conditions, analogous discrete objects, random decorated discrete trees, converge in the scaling limit to decorated α-stable trees. We mention a few examples where those objects appear in the context of random trees and planar maps, and we expect them to naturally arise in many more cases.
en
Research Areas:
Mathematical and Algorithmic Foundations: 95% Computer Science Foundations: 5%