Newman-Ziff algorithm for the bootstrap percolation: application to the Archimedean lattices

Abstract

We propose very efficient algorithms for the bootstrap percolation and the diffusion percolation models by extending the Newman-Ziff algorithm of the classical percolation [M. E. J. Newman and R. M. Ziff, Phys. Rev. Lett. 85 (2000) 4104]. Using these algorithms and the finite-size-scaling, we calculated with high precision the percolation threshold and critical exponents in the eleven two-dimensional Archimedean lattices. We present the condition for the continuous percolation transition in the bootstrap percolation and the diffusion percolation, and show that they have the same critical exponents as the classical percolation within error bars in two dimensions. We conclude that the bootstrap percolation and the diffusion percolation almost certainly belong to the same universality class as the classical percolation.

References in corpus (3)

• Pseudorandom Number Generators and the Square Site Percolation Threshold
• Correction-to-scaling exponent for two-dimensional percolation
• Fate of Ising ferromagnets and antiferromagnets by zero-temperature Glauber dynamics on the two-dimensional Archimedean and 2-uniform lattices

Cited by in corpus (4)

• Highly Clustered Complex Networks in the Configuration Model: Random Regular Small-World Network
• Universality class of the percolation in two-dimensional lattices with distortion
• Bootstrap and diffusion percolation transitions in three-dimensional lattices
• On the monotonicity of the critical time in the Constrained-degree percolation model