Efficient implementation of the Pivot algorithm for self-avoiding walks

DOI10.1007/s10955-010-9994-8zbMath1197.82057arXiv1005.1444OpenAlexW2144056067MaRDI QIDQ5961852

Nathan Clisby

Publication date: 16 September 2010

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.1444

zbMATH Keywords

Monte Carlopolymerpivot algorithmself-avoiding walk

Mathematics Subject Classification ID

Statistical mechanics of polymers (82D60) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Self-avoiding walks in a rectangle ⋮ The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake ⋮ Stochastic enumeration method for counting NP-hard problems ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks ⋮ Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm ⋮ The self-avoiding walk spanning a strip ⋮ Transforming fixed-length self-avoiding walks into radial \(\text{SLE}_{8/3}\) ⋮ Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps ⋮ Efficient implementation of the Pivot algorithm for self-avoiding walks ⋮ Simulating self-avoiding walks in bounded domains ⋮ The fixed irreducible bridge ensemble for self-avoiding walks ⋮ Conformal invariance predictions for the three-dimensional self-avoiding walk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correction-to-scaling exponents for two-dimensional self-avoiding walks
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
• A faster implementation of the pivot algorithm for self-avoiding walks
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Cache-Oblivious Algorithms
• Efficient implementation of the Pivot algorithm for self-avoiding walks