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.

6 pages, 4 figures, RevTex4

References in corpus (7)

• Efficient Monte Carlo algorithm and high-precision results for percolation
• Critical Percolation in Finite Geometries
• Path Crossing Exponents and the External Perimeter in 2D Percolation
• The Number of Incipient Spanning Clusters in Two-Dimensional Percolation
• Exact Multifractal Exponents for Two-Dimensional Percolation
• Percolation Threshold, Fisher Exponent, and Shortest Path Exponent for 4 and 5 Dimensions
• Simulation of percolation on massively-parallel computers

Cited by in corpus (6)

• Numerical results for crossing, spanning and wrapping in two-dimensional percolation
• Site-Percolation Threshold of Carbon Nanotube Fibers: Fast Inspection of Percolation with Markov Stochastic Theory
• Number of spanning clusters at the high-dimensional percolation thresholds
• Winding clusters in percolation on the Torus and the Moebius strip
• Comment on: "Superscaling of Percolation on Rectangular Domains"
• Fine-grained domain counting and percolation analysis in 2D lattice systems with linked-lists