Sharpness of the phase transition for Voronoi percolation in dimension larger than two
42 mins 10 secs,
319.34 MB,
WebM
640x360,
29.97 fps,
44100 Hz,
1.0 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
Description: |
Tassion, V (Université de Genève)
Wednesday 13th July 2016 - 13:30 to 14:15 |
---|
Created: | 2016-07-20 09:45 |
---|---|
Collection: | Theoretical Foundations for Statistical Network Analysis |
Publisher: | Isaac Newton Institute |
Copyright: | Tassion, V |
Language: | eng (English) |
Distribution: | World (downloadable) |
Explicit content: | No |
Aspect Ratio: | 16:9 |
Screencast: | No |
Bumper: | UCS Default |
Trailer: | UCS Default |
Abstract: | Take a Poisson point process on Rd and consider its Voronoi tessellation. Colour each cell of the tessellation black with probability p and white with probability 1−p independently of each other. This rocess undergoes a phase transition at a critical parameter pc(d): below pc(d) all the black connected components are bounded almost surely, and above pc there isan unbounded black connected component almost surely. In any dimension d larger than 2, we prove that for
p<pc(d) the probability that there exists a black path connecting the origin to distance n decays exponentially fast in n. The talk is based on a joint work with H. Duminil-Copin and A. Raoufi. |
---|
Available Formats
Format | Quality | Bitrate | Size | |||
---|---|---|---|---|---|---|
MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 613.27 MB | View | Download | |
WebM * | 640x360 | 1.0 Mbits/sec | 319.34 MB | View | Download | |
iPod Video | 480x270 | 522.13 kbits/sec | 161.19 MB | View | Download | |
MP3 | 44100 Hz | 249.74 kbits/sec | 77.19 MB | Listen | Download | |
Auto | (Allows browser to choose a format it supports) |