Asymptotics of heights in random trees constructed by aggregation

preprint2016arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.