Growing lattice animals and Monte-Carlo methods

✍ Scribed by G.R. Reich; P.L. Leath

• Book ID: 103044144
• Publisher: Elsevier Science
• Year: 1980
• Tongue: English
• Weight: 397 KB
• Volume: 19
• Category: Article
• ISSN: 0010-4655
• DOI: 10.1016/0010-4655(80)90063-6

✦ Synopsis

We consider the search problems which arise in Monte-Carlo studies involving growing lattice animals. A new periodic hashing scheme (based on a periodic cell) especially suited to these problems is presented which takes advantage both of the connected geometric structure of the animals and the traversal-oriented nature of the search. The scheme is motivated by a physical analogy and tested numerically on compact and on ramified animals. In both cases the performance is found to be more efficient than random hashing, and to a degree depending on the compactness of the animals.