Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,979,978 papers from all fields of science
Search
Sign In
Create Free Account
Self-avoiding walk
Known as:
Self-avoiding polygon
, Saw (disambiguation)
, Self avoiding walk
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Broader (1)
Computational chemistry
Computational physics
Erdős–Rényi model
Fractal
Fractal dimension
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Monte Carlo study of surface and line-width roughness of resist film surfaces during dissolution
G. Patsis
Mathematics and Computers in Simulation
2005
Corpus ID: 206787901
Highly Cited
2004
Highly Cited
2004
Multiple Markov chain Monte Carlo study of adsorbing self-avoiding walks in two and in three dimensions
E. J. J. Rensburg
,
A. Rechnitzer
2004
Corpus ID: 41228535
A self-avoiding walk adsorbing on a line in the square lattice, and on a plane in the cubic lattice, is studied numerically as a…
Expand
1999
1999
On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids
J. Atkins
,
W. Hart
Algorithmica
1999
Corpus ID: 36746321
Abstract. We describe a proof of NP-hardness for a lattice protein folding model whose instances contain protein sequences…
Expand
1998
1998
On anisotropic spiral self-avoiding walks
R. Brak
,
A. Owczarek
,
C. Soteros
1998
Corpus ID: 27847560
We report on a Monte Carlo study of so-called two-choice-spiral self-avoiding walks on the square lattice. These have the…
Expand
1988
1988
Self-avoiding random loops
L. Dubins
,
A. Orlitsky
,
J. Reeds
,
L. Shepp
IEEE Transactions on Information Theory
1988
Corpus ID: 10566953
A random loop, or polygon, is a simple random walk whose trajectory is a simple Jordan curve. The study of random loops is…
Expand
1984
1984
On two-dimensional self-avoiding random walks
A. Guttmann
1984
Corpus ID: 51823698
Following Nienhuis' (1982) exact evaluation of the connective constant of the honeycomb lattice self-avoiding walk model, and the…
Expand
1984
1984
Convergence and extrapolation in finite-size scaling renormalization
V. Privman
1984
Corpus ID: 55901111
1983
1983
Spiral self-avoiding walks
V. Privman
1983
Corpus ID: 123404790
Self-avoiding walks with a 'spiral' constraint, on the square lattice, are enumerated up to 40 steps. Numerical evidence suggests…
Expand
Highly Cited
1983
Highly Cited
1983
Critical properties of directed self-avoiding walks
S. Redner
,
I. Majid
1983
Corpus ID: 122320850
The generating functions and mean displacements of various two-dimensional directed self-avoiding walk models are calculated…
Expand
Highly Cited
1981
Highly Cited
1981
Phenomenological renormalisation of the self avoiding walk in two dimensions
B. Derrida
1981
Corpus ID: 122342693
Phenomenological renormalisation is used to calculate the exponent v and the connective constant of the self-avoiding walk…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE