University of Cambridge > Talks.cam > Combinatorics Seminar > Bootstrap percolation in two dimensions: recent progress and open problems

Bootstrap percolation in two dimensions: recent progress and open problems

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

  • UserRob Morris (IMPA)
  • ClockThursday 29 April 2010, 14:30-15:30
  • HouseMR12.

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

In this talk I shall describe two very recent developments in the study of bootstrap percolation in two dimensions: the sharp bounds proved by Duminil-Copin and Holroyd for a very large class of (local) update rules, and the much sharper bounds proved for the nearest-neighbour rule by Gravner, Holroyd and myself. I shall discuss how these results could be further generalized, and give several open problems.

This talk is part of the Combinatorics Seminar 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