University of Cambridge > > Probability > Recursive triangulations and fragmentation theory

Recursive triangulations and fragmentation theory

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

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

Consider the convex regular polygon with n vertices. A triangulation of this polygon is a set of n-3 non crossing diagonals that completely triangulates it. We study random triangulations obtained by adding diagonals progressively, and in particular not sampled from the uniform measure. We establish the convergence of these random triangulations towards a random closed subset of Hausdorff dimension (\sqrt{17}-3)/2.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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