Asymptotics of heights in random trees constructed by aggregation

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…