论文信息 - A FORTRAN program for cluster enumeration

A FORTRAN program for cluster enumeration

A simple FORTRAN program based primarily on the algorithm of Martin is presented for enumerating isolated connected clusters of up to a given specified number of particles on the square lattice. A brief explanation of the workings of the program is also provided to facilitate its use by those interested in this problem. To order 15, the program enumerates clusters at an average rate of approximately 63,000/sec when implemented on an IBM 370/168 with the extended optimizing compiler.

Sidney Redner | S. Redner

[1] Heather J. Ruskin,et al. Bond percolation processes in d dimensions , 1978 .

[2] H. Ruskin,et al. Higher connectivity in random mixtures = the universality class of 2-cluster percolation , 1982 .

[3] H. Peters,et al. Radius, perimeter, and density profile for percolation clusters and lattice animals , 1979 .

[4] D. Stauffer. Scaling Theory of Percolation Clusters , 1979, Complex Media and Percolation Theory.

[5] M. Sykes,et al. Percolation processes in two dimensions. I. Low-density series expansions , 1976 .

[6] D. Gaunt,et al. Percolation processes in three dimensions , 1976 .