Slow Convergence in Bootstrap Percolation

Details Slow Convergence in Bootstrap Percolation Slow Convergence in Bootstrap Percolation

2007-05-09

arxiv.org/abs/0705.1347v1

Mathematics

Probability

22 pages, 3 figures

Scientific paper

In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L,p)->(infinity,0), the probability that the entire square is eventually infected is known to undergo a phase transition in the parameter p log L, occurring asymptotically at lambda = pi^2/18. We prove that the discrepancy between the critical parameter and its limit lambda is at least Omega((log L)^(-1/2)). In contrast, the critical window has width only Theta((log L)^(-1)). For the so-called modified model, we prove rigorous explicit bounds which imply for example that the relative discrepancy is at least 1% even when L = 10^3000. Our results shed some light on the observed differences between simulations and rigorous asymptotics.

Affiliated with

Also associated with

No associations

Rating

Slow Convergence in Bootstrap Percolation 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 Slow Convergence in Bootstrap Percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slow Convergence in Bootstrap Percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-646325