University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The phase transition for Boolean percolation

The phase transition for Boolean percolation

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

If you have a question about this talk, please contact info@newton.ac.uk.

RGMW06 - RGM follow up

We consider Boolean percolation in dimension d. Around every point of a Poisson point process of intensity lambda, draw a ball of random radius, independently for different points. We investigate the connection probabilities in the subcritical regime and use the randomized algorithm method to prove that the phase transition in lambda is sharp. Interestingly, for this process, sharpness of the phase transition does not imply exponential decay of connection probabilities in the subcritical regime, and its meaning depends on the  law of the radii. In this talk, we will focus on this specific feature of Boolean percolation. This talk is based on a joint work with H. Duminil-Copin and A. Raoufi.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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