University of Cambridge > Talks.cam > Probability > On the peeling process of random planar maps

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

On the peeling process of random planar maps

Download to your calendar using vCal

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

Abstract : The spatial Markov property of random planar maps is arguably one of the most useful properties of these random lattices. Roughly speaking, it says that after exploring a region of the map, the law of the remaining part only depends on the perimeter of the discovered region. It has been first heuristically used by Watabiki in the physics literature under the name of ``peeling process’’ but was rigorously defined in 2003 by Angel in the case of the Uniform Infinite Planar Triangulation (UIPT). Since then, it has been used to derive information about the metric, (bernoulli and first passage) percolation, simple random walk and recently about the conformal structure of random planar maps. It is also at the core of the construction of ``hyperbolic’’ random maps. In this talk, we will introduce smoothly the peeling process and present some of its main applications.

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

Senior Parlour, Gonville & Caius College Average on weekdays: 8973.62867647 kWh https://zoom.us/j/98188045146

Other talks

Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Spectral theory for Dirac operators with singular potentials Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning Content, Caching and Kubernetes: Performance and User Experience in the Browser Title TBC Afternoon Break
 

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