Asynchronously parallelised percolation on distributed machines

Abstract

We propose a powerful method based on the Hoshen-Kopelman algorithm for simulating percolation asynchronously on distributed machines. Our method demands very little of hardware and yet we are able to make high precision measurements on very large lattices. We implement our method to calculate various cluster size distributions on large lattices of different aspect ratios spanning three orders of magnitude for two-dimensional site and bond percolation. We find that the nonuniversal constants in the scaling function for the cluster size distribution apparently satisfy a scaling relation, and that the moment ratios for the largest cluster size distribution reveal a characteristic aspect ratio at r approx. 9.