Towards universality in bootstrap percolation
40 mins 32 secs,
154.83 MB,
iPod Video
480x270,
29.97 fps,
44100 Hz,
521.53 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Smith, P (University of Cambridge)
Monday 11th July 2016 - 13:45 to 14:30 |
|---|
| Created: | 2016-07-18 17:22 |
|---|---|
| Collection: | Theoretical Foundations for Statistical Network Analysis |
| Publisher: | Isaac Newton Institute |
| Copyright: | Smith, P |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | Bootstrap percolation is a broad class of monotone cellular automata, which has links to the Glauber dynamics of the Ising model and other areas of statistical physics. Starting with random initial conditions, the question is to determine the threshold for complete occupation of the underlying graph. Until relatively recently, only nearest-neighbour models (and relatively minor variants of these models) had been studied -- and these are now very well understood. In this talk I will discuss a new `universality' theory for bootstrap percolation, which has emerged in the last few years. In particular, I will explain the classification of two-dimensional models, give more precise results for so-called `critical' models (also in two dimensions), and talk about a new classification theorem for higher dimensional models. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 589.61 MB | View | Download | |
| WebM | 640x360 | 609.48 kbits/sec | 181.01 MB | View | Download | |
| iPod Video * | 480x270 | 521.53 kbits/sec | 154.83 MB | View | Download | |
| MP3 | 44100 Hz | 249.82 kbits/sec | 74.23 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||