Parallel computation of cluster properties: application to 2D percolation
- 11 March 1987
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 20 (4) , 985-993
- https://doi.org/10.1088/0305-4470/20/4/032
Abstract
The authors discuss various parallel algorithms for the enumeration of two-dimensional cluster properties in such problems as percolation and the Ising model. As an application, in a Monte Carlo simulation performed on the ICL distributed array processor (DAP), they re-examine the numerical evidence for a recent conjecture by Jug (1986) concerning percolation singularities in two dimensions.Keywords
This publication has 12 references indexed in Scilit:
- Ising-like critical phenomena in two-dimensional percolation: series expansion evidenceJournal of Physics A: General Physics, 1986
- Evidence for Ising-Type Critical Phenomena in Two-Dimensional PercolationPhysical Review Letters, 1986
- Evidence for Ising-Type Critical Phenomena in Two-Dimensional PercolationPhysical Review Letters, 1985
- Dilute Ferromagnet, Percolation, andSpin-Glass Phase Transitions from Grassmann Path IntegralsPhysical Review Letters, 1984
- VLSI Algorithms for the Connected Component ProblemSIAM Journal on Computing, 1983
- A FORTRAN program for cluster enumerationJournal of Statistical Physics, 1982
- Percolation theoryReports on Progress in Physics, 1980
- Scaling theory of percolation clustersPhysics Reports, 1979
- Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithmPhysical Review B, 1976
- Mean number of clusters for percolation processes in two dimensionsJournal of Physics A: General Physics, 1976