BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Noise sensitivity in bootstrap percolation - Gábor Pete (Renyi In
 stitute and TU Budapest)
DTSTART:20160505T133000Z
DTEND:20160505T143000Z
UID:TALK65995@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:Answering questions of Itai Benjamini\, we show that the\neven
 t of complete occupation in 2-neighbour bootstrap percolation on the d-dim
 ensional 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\nd-2\, it is insensiti
 ve. Many open problems remain.\n\nJoint work with Zsolt Bartha (http://fro
 nt.math.ucdavis.edu/1509.08454)\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR