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 .

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:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 8939.40252294 kWh FW 11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Abcam meetings

Other talks

Title to be confirmed Group Work A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Machine Politics? Computers and AI in the History of Political Thought Evolution: Inevitable or Remarkable? Group Work
 

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