Random site percolation thresholds on square lattice for complex neighborhoods containing sites up to the sixth coordination zone
From MaRDI portal
Publication:6128243
Abstract: The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and isolating), is useful for a lot of problems ranging from core condensed matter to interdisciplinary application of statistical physics in epidemiology or any other transportation or connectivity problems. In this paper -- with Newman--Ziff fast Monte Carlo algorithm and finite-size scaling theory -- we compute the random site percolation thresholds for a square lattice with complex neighborhoods containing sites from the sixth coordination zone. Complex neighborhoods are those that contain sites from various coordination zones (which are not necessarily compact ones). We present the source codes of the appropriate procedures (written in C) and the results of their usage in computations of the percolation threshold on the square lattice for neighborhoods containing sites up to the sixth coordination zone. We conclude that similarly to the honeycomb lattice, the percolation thresholds for complex neighborhoods on a square lattice follow the power law with , where is the weighted distance of sites in complex neighborhoods ( and are the distance from the central site and the number of sites in the coordination zone , respectively).
This page was built for publication: Random site percolation thresholds on square lattice for complex neighborhoods containing sites up to the sixth coordination zone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6128243)