Asynchronously parallelised percolation on distributed machines

Details Asynchronously parallelised percolation on distributed machines Asynchronously parallelised percolation on distributed machines

2002-11-12

arxiv.org/abs/cond-mat/0211240v2

Phys. Rev. E 67, 037701 (2003)

Physics

Condensed Matter

Statistical Mechanics

6 pages, 4 figures, RevTex4

Scientific paper

10.1103/PhysRevE.67.037701

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.

Affiliated with

Also associated with

No associations

Rating

Asynchronously parallelised percolation on distributed machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asynchronously parallelised percolation on distributed machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronously parallelised percolation on distributed machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19028