English

Asymptotics of heights in random trees constructed by aggregation

Probability 2016-06-22 v1

Abstract

To each sequence (an)(a_n) of positive real numbers we associate a growing sequence (Tn)(T_n) of continuous trees built recursively by gluing at step nn a segment of length ana_n on a uniform point of the pre-existing tree, starting from a segment T1T_1 of length a1a_1. Previous works on that model focus on the influence of (an)(a_n) on the compactness and Hausdorff dimension of the limiting tree. Here we consider the cases where the sequence (an)(a_n) is regularly varying with a non-negative index, so that the sequence (Tn)(T_n) exploses. We determine the asymptotics of the height of TnT_n and of the subtrees of TnT_n spanned by the root and \ell points picked uniformly at random and independently in TnT_n, for all N\ell \in \mathbb N.

Keywords

Cite

@article{arxiv.1606.06536,
  title  = {Asymptotics of heights in random trees constructed by aggregation},
  author = {Bénédicte Haas},
  journal= {arXiv preprint arXiv:1606.06536},
  year   = {2016}
}
R2 v1 2026-06-22T14:30:23.897Z