University of Cambridge > Talks.cam > Probability > Recursive triangulations and fragmentation theory

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Recursive triangulations and fragmentation theory

Download to your calendar using vCal

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

This talk has been canceled/deleted

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.

http://www.math.ens.fr/~curien/

This talk is part of the Probability series.

This talk is included in these lists:

  • This talk is not included in any other list

Note that ex-directory lists are not shown.

Other lists

Electrical Engineering Seminar Room and Online (registration required) Type the title of a new list here Ryle Seminar Room

Other talks

Necessary mechanisms for super AI and stopping hallucinations: The consistent reasoning paradox and the indeterminacy function Angular analyses of b -> s ee decays at LHCb External Seminar - Hilde Nelissen TBC Quantum graphs with a time asymmetry: spectral optimization and spectral statistics Neighbourhoods as Thorny Matters: A Qualitative Analysis of How Local Conditions Shape Mental Health and Everyday Life in Palestine title and abstract tba (joint seminar with Spectral Geometry in the Clouds)
 

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