✦ LIBER ✦

A Faster Implementation of the Pivot Algorithm for Self-Avoiding Walks

✍ Scribed by Tom Kennedy

Book ID: 110323764
Publisher: Springer
Year: 2002
Tongue: English
Weight: 208 KB
Volume: 106
Category: Article
ISSN: 0022-4715
DOI: 10.1023/a:1013750203191

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic critical exponent of the BFACF a

Dynamic critical exponent of the BFACF algorithm for self-avoiding walks

✍ Sergio Caracciolo; Andrea Pelissetto; Alan D. Sokal 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 427 KB

Cut-and-Permute Algorithm for Self-Avoid

Cut-and-Permute Algorithm for Self-Avoiding Walks in the Presence of Surfaces

✍ Maria Serena Causo 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 221 KB

On the average span of self-avoiding wal

On the average span of self-avoiding walks

✍ A. Bellemans 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 255 KB

Performance of new algorithms for self-a

Performance of new algorithms for self-avoiding walks with fixed endpoints

✍ Sergio Caracciolo; Andrea Pelissetto; Alan D. Sokal 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A note on the critical dimension for wea

A note on the critical dimension for weakly self-avoiding walks

✍ Wei-Shih Yang; D. Klein 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 600 KB

Renormalization of self-avoiding walks o

Renormalization of self-avoiding walks on the square lattice

✍ A. Malakis 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 402 KB

The complications encountered in direct renormalization approaches for the self-avoiding walk problem are discussed. Using a decimation transformation on the square lattice, sequences of approximants to the critical exponent Y and to the inverse connective constant K,(l/K, = ~1 are obtained.