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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Bootstrap percolation in two dimensions: recent progress and open problems

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Co-hosted with Pardee Center for the Study of Longer-Range Future, Boston University Average on weekdays: 9109.37628111 kWh Barrett Room, Department of Radiology, Level 5

Other talks

Title to be confirmed Feedback and the circumgalactic medium Filial Lines: Art Spiegelman, Alison Bechdel, and Comics Form Genomic Medicine CPC Group Work Rothschild Public Lecture: The Quantum Centenary: from Order to Chaos
 

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