Random trees constructed by aggregation

DOI10.5802/AIF.3126MaRDI QIDQ4557596zbMATH OpenOpenAlexFDO

Authors Nicolas Curien, Bénédicte Haas

Publication date 26 November 2018

Published in Annales de l’institut Fourier (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

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

zbMATH Keywords

fractal dimensionGromov-Hausdorff convergencerandom treesstick-breaking

Mathematics Subject Classification ID

Trees (05C05) Fractals (28A80) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

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.

Recommendations

• Asymptotics of heights in random trees constructed by aggregation
• Random gluing of metric spaces
• Compactness and fractal dimensions of inhomogeneous continuum random trees
• The continuum random tree. III
• Recursive construction of continuum random trees

Cites work

• A line-breaking construction of the stable trees
• A time-dependent version of Pólya's urn
• Asymptotics of heights in random trees constructed by aggregation
• Conformally invariant scaling limits: an overview and a collection of problems
• Diffusion-limited aggregation on a tree
• Explosion and linear transit times in infinite trees
• scientific article; zbMATH DE number 3648765 (Why is no real title available?)
• scientific article; zbMATH DE number 1994007 (Why is no real title available?)
• Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
• Random real trees
• The continuum random tree. I

Cited in

(15)

• Recursive construction of continuum random trees
• Self-similar real trees defined as fixed points and their geometric properties
• Geometry of weighted recursive and affine preferential attachment trees
• Regularity of an abstract Wiener integral
• Random gluing of metric spaces
• Trees with non-regular fractal boundary
• Compactness and fractal dimensions of inhomogeneous continuum random trees
• Entropy and Hausdorff dimension in random growing trees
• Random walks with preferential relocations and fading memory: a study through random recursive trees
• Aggregation tree construction using hierarchical structures
• Stable graphs: distributions and line-breaking construction
• A binary embedding of the stable line-breaking construction
• Depths in random recursive metric spaces
• Uniform attachment with freezing: scaling limits
• The scaling limit of the root component in the wired minimal spanning forest of the Poisson weighted infinite tree

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)