skip to content

Random trees constructed by aggregation

Monday 16th March 2015 - 11:30 to 12:30
INI Seminar Room 1
Co-author: Nicolas Curien (Université Paris-Sud)

Starting from a sequence of positive numbers (a_n), we build an increasing sequence of random trees (T_n) by deciding that T_1 is a segment of length a_1, and then, recursively, attaching at step n a segment of length a_n on a uniform point of the tree T_{n-1}. We will see how the sequence (a_n) influences the geometric properties of the limiting tree: compactness, Hausdorff dimension, self-similarity.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons