A fast cluster counting algorithm for percolation on and off lattices Original Research Article

A fast counting algorithm is used to enumerate the clusters for determining their statistics, for investigation the percolation behaviour of the largest cluster and for calculating the fractal dimensions D. The algorithm is suitable for parallel processing. It can be expanded for off-lattice systems, where particles are considered to be connected when they are separated by less than a given threshold. For determining the fractal dimensions D, the procedure is very fast in investigating supercells, where replica of smaller boxes with off-lattice structures are arranged.