University of Cambridge > Talks.cam > Combinatorics Seminar > Noise sensitivity in bootstrap percolation

Noise sensitivity in bootstrap percolation

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

  • UserGábor Pete (Renyi Institute and TU Budapest)
  • ClockThursday 05 May 2016, 14:30-15:30
  • HouseMR12.

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

Answering questions of Itai Benjamini, we show that the event of complete occupation in 2-neighbour bootstrap percolation on the d-dimensional box [n]^d, for d\geq 2, at its critical initial density p_c(n), is noise sensitive, while in k-neighbour bootstrap percolation on the d-regular random graph G_{n,d}, for 2\leq k\leq d-2, it is insensitive. Many open problems remain.

Joint work with Zsolt Bartha (http://front.math.ucdavis.edu/1509.08454)

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-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity