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
Coauthor: Nicolas Curien (Universit ParisSud)
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_{n1}. We will see how the sequence (a_n) influences the geometric properties of the limiting tree: compactness, Hausdorff dimension, selfsimilarity.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
