Abstract
A new algorithm to test percolation conditions for the solution of percolation problems on a lattice and continuum percolation for spaces of an arbitrary dimension has been proposed within the Newman–Ziff algorithm. The algorithm is based on the use of bitwise operators and does not reduce the efficiency of the operation of the Newman–Ziff algorithm as a whole. This algorithm makes it possible to verify the existence of both clusters touching boundaries at an arbitrary point and single-loop clusters continuously connecting the opposite boundaries in a percolating system with periodic boundary conditions. The existence of a cluster touching the boundaries of the system at an arbitrary point for each direction, the formation of a one-loop cluster, and the formation of a cluster with an arbitrary number of loops on a torus can be identified in one calculation by combining the proposed algorithm with the known approaches for the identification of the existence of a percolation cluster. The operation time of the proposed algorithm is linear in the number of objects in the system.
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 callDisclaimer: 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.
