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

DOI10.1016/J.ENDM.2017.05.004zbMATH Open1427.05213OpenAlexW2623577381MaRDI QIDQ1687779FDOQ1687779

Authors: 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

Recommendations

• Self-avoiding walk enumeration via the lace expansion
• Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• scientific article; zbMATH DE number 1003292
• Self-testing algorithms for self-avoiding walks

zbMATH Keywords

critical exponentself-avoiding walkrandom generationconnective constant

Mathematics Subject Classification ID

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

Cites Work

• The Monte Carlo Method
• Title not available (Why is that?)
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• Extendable self-avoiding walks
• A faster implementation of the pivot algorithm for self-avoiding walks
• Self-avoiding polygons on the square lattice
• Generalized atmospheric Rosenbluth methods (GARM)
• On the importance sampling of self-avoiding walks
• A Monte Carlo study of non-trapped self-avoiding walks

Cited In (3)

• Fast algorithms for computing self-avoiding walks and mesh intersections over unstructured meshes
• Self-testing algorithms for self-avoiding walks
• Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687779)