Noise sensitivity in bootstrap percolation

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

• Gábor Pete (Renyi Institute and TU Budapest)
• Thursday 05 May 2016, 14:30-15:30
• MR12.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.