A sharper threshold for bootstrap percolation in two dimensions

Details A sharper threshold for bootstrap percolation in two dimensions A sharper threshold for bootstrap percolation in two dimensions

2010-02-20

arxiv.org/abs/1002.3881v2

Mathematics

Probability

21 pages

Scientific paper

Two-dimensional bootstrap percolation is a cellular automaton in which sites become 'infected' by contact with two or more already infected nearest neighbors. We consider these dynamics, which can be interpreted as a monotone version of the Ising model, on an n x n square, with sites initially infected independently with probability p. The critical probability p_c is the smallest p for which the probability that the entire square is eventually infected exceeds 1/2. Holroyd determined the sharp first-order approximation: p_c \sim \pi^2/(18 log n) as n \to \infty. Here we sharpen this result, proving that the second term in the expansion is -(log n)^{-3/2+ o(1)}, and moreover determining it up to a poly(log log n)-factor. The exponent -3/2 corrects numerical predictions from the physics literature.

Affiliated with

Also associated with

No associations

Rating

A sharper threshold for bootstrap percolation in two dimensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A sharper threshold for bootstrap percolation in two dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sharper threshold for bootstrap percolation in two dimensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692647