✦ LIBER ✦

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

✍ Scribed by Sergio Caracciolo; Andrea Pelissetto; Alan D. Sokal

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-local Monte Carlo algorithm for self

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

New Upper Bounds for the Connective Cons

✍ John Noonan 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 669 KB

Dynamic critical exponent of the BFACF a

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

A Faster Implementation of the Pivot Alg

✍ Tom Kennedy 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 208 KB

Nonergodicity of local, length-conservin

✍ Neal Madras; Alan D. Sokal 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 987 KB

Cut-and-Permute Algorithm for Self-Avoid

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