BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Random trees constructed by aggregation - Haas\, B (Universit Pari
 s-Dauphine)
DTSTART:20150316T113000Z
DTEND:20150316T123000Z
UID:TALK58414@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Co-author: Nicolas Curien (Universit Paris-Sud) \n\nStarting f
 rom 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\, a
 nd then\, recursively\, attaching at step n a segment of length a_n on a u
 niform point of the tree T_{n-1}. We will see how the sequence (a_n) influ
 ences the geometric properties of the limiting tree: compactness\, Hausdor
 ff dimension\, self-similarity.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR