New algorithm to test percolation conditions within the Newman-Ziff algorithm

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