An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension

DOI10.1016/j.endm.2017.05.004zbMath1427.05213OpenAlexW2623577381MaRDI QIDQ1687779

Pascal Préa, Mathieu Rouault, François Brucker

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.05.004

zbMATH Keywords

critical exponentrandom generationself-avoiding walkconnective constant

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• A faster implementation of the pivot algorithm for self-avoiding walks
• Extendable self-avoiding walks
• A Monte Carlo study of non-trapped self-avoiding walks
• On the Importance Sampling of Self-Avoiding Walks
• Generalized atmospheric Rosenbluth methods (GARM)
• Self-avoiding polygons on the square lattice
• The Monte Carlo Method

This page was built for publication: An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension