A Monte Carlo method for series expansions
- 1 December 1986
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 19 (17) , L1057-L1061
- https://doi.org/10.1088/0305-4470/19/17/002
Abstract
The authors describe a simple and general algorithm to calculate series expansions in enumeration problems to large orders approximately by a Monte Carlo method. It can be used to generate unbiased samples in cluster studies, e.g. linear or branched polymers, random surfaces, etc., in any dimension. They calculate the number of site animals of size n on the square lattice for n <or= 50 and their average size to better than 1% accuracy.Keywords
This publication has 17 references indexed in Scilit:
- Generating functions for connected embeddings in a lattice. I. Strong embeddingsJournal of Physics A: General Physics, 1986
- Extrapolation of transfer matrix data for percolation and lattice animals by the Romberg-Beleznay algorithmJournal of Physics A: General Physics, 1986
- Self-avoiding walk model for proteinsZeitschrift für Physik B Condensed Matter, 1985
- New Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1985
- Monte Carlo test of dimensional reduction for branched polymers in three dimensionsJournal of Physics A: General Physics, 1985
- Corrections to scaling and phenomenological renormalization for 2-dimensional percolation and lattice animal problemsJournal de Physique, 1985
- Site and bond directed branched polymers for arbitrary dimensionality: evidence supporting a relation with the Lee-Yang edge singularityJournal of Physics A: General Physics, 1982
- A FORTRAN program for cluster enumerationJournal of Statistical Physics, 1982
- Position-space renormalisation group for isolated polymer chainsJournal of Physics A: General Physics, 1981
- Hard-square lattice gasJournal of Statistical Physics, 1980