OAK

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

Metadata Downloads
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 (2000) [27]). 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. (C) 2019 Elsevier Inc. All rights reserved.
Author(s)
Choi, Jeong-OkYu, Unjong
Issued Date
2019-06
Type
Article
DOI
10.1016/j.jcp.2019.02.005
URI
https://scholar.gist.ac.kr/handle/local/12701
Publisher
Academic Press
Citation
Journal of Computational Physics, v.386, pp.1 - 8
ISSN
0021-9991
Appears in Collections:
Department of Physics and Photon Science > 1. Journal Articles
Department of Mathematical Sciences > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.