Improved rosenbluth monte carlo scheme for cluster counting and lattice animal enumeration

@article{Care2000ImprovedRM,
  title={Improved rosenbluth monte carlo scheme for cluster counting and lattice animal enumeration},
  author={Care and Ettelaie},
  journal={Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics},
  year={2000},
  volume={62 1 Pt B},
  pages={
          1397-404
        }
}
  • Care, Ettelaie
  • Published 1 July 1997
  • Mathematics
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
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 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 obtain a Monte Carlo estimate of the number of distinct lattice animals on any lattice… 
5 Citations

Figures and Tables from this paper

Simulations of lattice animals and trees

TLDR
The collapse of animals and trees is discussed, arguing that the present version of the algorithm is also efficient for some of the models studied in this context, but showing that it is not very efficient for the 'classical' model for collapsing animals.

Generalized atmospheric Rosenbluth methods (GARM)

TLDR
The classical Rosenbluth method for sampling self-avoiding walks and polygons can be extended to a general algorithm for sampling many families of objects, including self- avoidanceing polygons, using an elementary move which is a generalization of kinetic growth.

Scaling behaviour of lattice animals at the upper critical dimension

TLDR
This work proposes, and test, a new Parisi-Sourlas-type scaling relation appropriate for the logarithmic-correction exponents of the lattice-animal problem at the upper critical dimension d = 8 on hypercubic lattices.

Graph animals, subgraph sampling, and motif search in large networks.

TLDR
A sampling algorithm for lattice animals is generalized to a Monte Carlo algorithm for "graph animals," i.e., connected subgraphs in arbitrary networks, and a number of methods that do not rely on measurements of Z scores or comparisons with null models are explored.

Matrix Elasticity of Void-Forming Hydrogels Controls Transplanted Stem Cell-Mediated Bone Formation

TLDR
By developing injectable, void-forming hydrogels that decouple pore formation from elasticity, this work shows that mesenchymal stem cell osteogenesis in vitro, and cell deployment in vitro and in vivo, can be controlled by modifying the hydrogel's elastic modulus or its chemistry.

References

SHOWING 1-10 OF 19 REFERENCES

Introduction To Percolation Theory

Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in

Phys Rev E 57

  • 1181
  • 1997

J Chem Phys 23

  • 356
  • 1955

J Phys A: Math Gen 21

  • 127
  • 1988

J Chem Phys 77

  • 979
  • 1982

Phys Rev A 46

  • 6252
  • 1992

and Taylor

  • Introduction to percolation theory
  • 1992

Z Physik B 34

  • 339
  • 1979

The sites examined but rejected along the way are indicated by X. In our notation this sequence can be represented by {0,1,1,0,0,0,1}