Noise sensitivity in bootstrap percolation
From MaRDI portal
Abstract: 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 dgeq 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 2leq kleq d-2, it is insensitive. Many open problems remain.
This page was built for publication: Noise sensitivity in bootstrap percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6265887)