Physics – Computational Physics
Scientific paper
1999-11-12
Physics
Computational Physics
18 Pages, 3 postscript figures: Submitted to Physical Review E
Scientific paper
10.1103/PhysRevE.62.1397
We describe an algorithm for the Rosenbluth Monte Carlo enumeration of clusters and lattice animals. The method may also be used to calculate associated properties such as moments or perimeter multiplicities of the clusters. The new scheme is an extension of the Rosenbluth method for growing polymer chains and is a simplification of a scheme reported earlier by one of the authors. The algorithm may be used to estimate the number of distinct lattice animals on any lattice topology. The method is validated against exact and Monte Carlo enumerations for clusters up to size 50, on a two dimensional square lattice and three dimensional simple cubic lattice. The method may be readily adapted to yield Boltzmann weighted averages over clusters.
Care C. M.
Ettelaie R.
No associations
LandOfFree
An improved Rosenbluth Monte Carlo scheme for cluster counting and lattice animal enumeration 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 An improved Rosenbluth Monte Carlo scheme for cluster counting and lattice animal enumeration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An improved Rosenbluth Monte Carlo scheme for cluster counting and lattice animal enumeration will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-196481