Bootstrap percolation on the hypercube

Abstract

In the bootstrap percolation on the n-dimensional hypercube, in the initial position each of the 2 n sites is occupied with probability p and empty with probability 1-p, independently of the state of the other sites. Every occupied site remains occupied for ever, while an empty site becomes occupied if at least two of its neighbours are occupied. If at the end of the process every site is occupied, we say that the (initial) position spans the hypercube. We shall show that there are constants c 1,c 2>0 such that for [InlineMediaObject not available: see fulltext.] the probability of spanning tends to 1 as n→∞, while for [InlineMediaObject not available: see fulltext.] the probability tends to 0. Furthermore, we shall show that for each n the transition has a sharp threshold function.