Abstract

New simulations involving up to nearly 109 sites for square lattice bootstrap percolation give a percolation threshold compatible with unity. In this model sites in a square lattice are initially occupied randomly, and then are removed if they have less than three occupied neighbours. The results are compared with those of similar models, such as that studied by Frobose (1989), and the earlier bootstrap and diffusion percolation models, in two, three and four dimensions, of Adler and Aharony (1986-8). In the latter models, the effective threshold approaches its asymptotic limit (one or zero) as ( lambda /ln L)d-1, for samples of size Ld, in agreement with theoretical predictions. The coefficient lambda decreases monotonically with the parameters which facilitate the removal (addition) of sites.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.