In the bootstrap percolation model, sites in an by square are initially independently declared active with probability . At each time step, an inactive site becomes active if at least two of its four neighbours are active. We study the behaviour as and simultaneously of the probability that the entire square is eventually active. We prove that if , and if , where . We prove the same behaviour, with the same threshold , for the probability that a site is active by time in the process on the infinite lattice. The same results hold for the so-called modified bootstrap percolation model, but with threshold . The existence of the thresholds settles a conjecture of Aizenman and Lebowitz, while the determination of their values corrects numerical predictions of Adler, Stauffer and Aharony.

生成讲解博客的中文版本

生成AI智能校验的中文版本