University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Random trees constructed by aggregation

Random trees constructed by aggregation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Random Geometry

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity