Random trees constructed by aggregation
- 👤 Speaker: Haas, B (Universit Paris-Dauphine)
- 📅 Date & Time: Monday 16 March 2015, 11:30 - 12:30
- 📍 Venue: Seminar Room 1, Newton Institute
Abstract
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Monday 16 March 2015, 11:30-12:30