COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Combinatorics Seminar > Universality for bootstrap percolation
Universality for bootstrap percolationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact ibl10. In this talk I will give an overview of the proof of the “Universality Conjecture” for general bootstrap percolation models. Roughly speaking, the conjecture states that every d-dimensional monotone cellular automaton is a member of one of d+1 universality classes, which are characterized by their behaviour on sparse random sets. More precisely, it states that if sites of the lattice Z^d are initially infected independently with probability p, then the expected infection time of the origin is either infinite, or is a tower of height r for some r \in {1,...,d}. I will also describe an uncomputability result regarding the exponent of p at the top of the tower. Based on joint work with Paul Balister, Béla Bollobás and Paul Smith. This talk is part of the Combinatorics Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsDIAL talks, Institute for Manufacturing Type the title of a new list here Type the title of a new list hereOther talksEMG reading group on Gopakuma-Vafa invariants. Correlated Resetting Gas Lunch Gram-scale explosions to inform numerical modelling and FREM development Waves, oscillatory double integrals, and multidimensional complex analysis Ocean boundary layer turbulence |