Sharp thresholds in Bootstrap percolation

József Balogh, Béla Bollobás

Research output: Contribution to journalArticlepeer-review


In the standard bootstrap percolation on the d-dimensional grid double-struck G signnd, in the initial position each of the nd sites is occupied with probability p and empty with probability 1-p, independently of the state of every other site. Once a site is occupied, it 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) configuration percolates. By making use of a theorem of Friedgut and Kalai (Proc. Amer. Math. Soc. 124 (1996) 2993), we shall show that the threshold function of the percolation is sharp. We shall prove similar results for three other models of bootstrap percolation as well.

Original languageEnglish (US)
Pages (from-to)305-312
Number of pages8
JournalPhysica A: Statistical Mechanics and its Applications
Issue number3-4
StatePublished - Aug 15 2003
Externally publishedYes


  • Bootstrap percolation
  • Cellular automata
  • Percolation
  • Sharp threshold
  • Threshold

ASJC Scopus subject areas

  • Statistics and Probability
  • Condensed Matter Physics


Dive into the research topics of 'Sharp thresholds in Bootstrap percolation'. Together they form a unique fingerprint.

Cite this