Skip to search formSkip to main contentSkip to account menu

Self-avoiding walk

Known as: Self-avoiding polygon, Saw (disambiguation), Self avoiding walk 
In mathematics, a self-avoiding walk (SAW) is a sequence of moves on a lattice (a lattice path) that does not visit the same point more than once… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-dimensional self-avoiding walks, for… 
Review
2010
Review
2010
We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove… 
2008
2008
We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks… 
Highly Cited
2007
Highly Cited
2007
We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an… 
Highly Cited
2007
2005
2005
We study self-avoiding walks (SAWs) on non-Euclidean lattices that correspond to regular tilings of the hyperbolic plane… 
1984
1984
Following Nienhuis' (1982) exact evaluation of the connective constant of the honeycomb lattice self-avoiding walk model, and the… 
1983
1983
Self-avoiding walks with a 'spiral' constraint, on the square lattice, are enumerated up to 40 steps. Numerical evidence suggests… 
Highly Cited
1983
Highly Cited
1983
The generating functions and mean displacements of various two-dimensional directed self-avoiding walk models are calculated… 
Highly Cited
1981
Highly Cited
1981
Phenomenological renormalisation is used to calculate the exponent v and the connective constant of the self-avoiding walk…