Random trees constructed by aggregation

DOI10.5802/AIF.3126zbMATH Open1404.60020arXiv1411.4255OpenAlexW2963587540MaRDI QIDQ4557596

Author name not available (Why is that?)

Publication date: 26 November 2018

Published in: (Search for Journal in Brave)

Abstract: We study a general procedure that builds random $mathbbR$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of branches influences some geometric properties of the limiting tree, such as compactness and Hausdorff dimension. In particular, when the sequence of lengths of branches behaves roughly like $n^{-alpha}$ for some $alphain(0,1]$, we show that the limiting tree is a compact random tree of Hausdorff dimension $alph{a}^{-1}$. This encompasses the famous construction of the Brownian tree of Aldous. When $alpha>1$, the limiting tree is thinner and its Hausdorff dimension is always 1. In that case, we show that $alph{a}^{-1}$ corresponds to the dimension of the set of leaves of the tree.

Full work available at URL: https://arxiv.org/abs/1411.4255

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Random trees constructed by aggregation

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