Abstract
A fast computer algorithm for enumerating isolated connected clusters on a regular lattice and its Fortran implementation are presented. New perimeter polynomials are calculated for the square, the triangular, the simple cubic, and the square lattice with next nearest neighbors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Stauffer,Introduction to Percolation Theory (Taylor & Francis, London, 1985), and references therein.
J. L. Martin, inPhase Transitions and Critical Phenomena, Vol. 3, C. Domb and M. S. Green, eds. (Academic Press, New York, 1974), pp. 97–112.
S. Redner,J. Stat. Phys. 29:309 (1982).
D. H. Redelmeier,Discr. Math. 36:191 (1981).
M. F. Sykes and M. Glen,J. Phys. A: Math. Gen. 9:87 (1976).
M. F. Sykes, D. S. Gaunt, and M. Glen,J. Phys. A: Math. Gen. 10:1705 (1976).
D. S. Gaunt, M. F. Sykes, and H. Ruskin,J. Phys. A: Math. Gen. 9:1899 (1976).
M. F. Sykes and M. K. Wilkinson,J. Phys. A: Math. Gen. 19:3407 (1986).
M. F. Sykes and M. K. Wilkinson,J. Phys. A: Math. Gen. 19:3415 (1986).
A. Margolina, Z. V. Djordjevic, D. Stauffer, and H. E. Stanley,Phys. Rev. B 28:1652 (1983).
H. P. Peters, D. Stauffer, H. P. Höllers, and K. Loewenich,Z. Physik B 34:399 (1979).
E. S. Demme and K. Diemer,J. Undergrad. Res. Phys. 3:25 (1984).
P. M. Lam,Phys. Rev. A 34:2339 (1986).
J. A. M. S. Duarte,Portgal. Phys. 12:99 (1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mertens, S. Lattice animals: A fast enumeration algorithm and new perimeter polynomials. J Stat Phys 58, 1095–1108 (1990). https://doi.org/10.1007/BF01026565
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01026565