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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We prove that self-avoiding walk on Z is sub-ballistic in any dimension d ≥ 2. That is, writing ||u|| for the Euclidean norm of u… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
A self-avoiding walk on the square lattice is prudent, if it never takes a step towards a vertex it has already visited. Préa was… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2009
Review
2009
Abstract: We give a survey and unified treatment of functional integral representations for both simple random walk and some self… (More)
Is this relevant?
2008
2008
We consider a long-range version of self-avoiding walk in dimension d > 2(α ∧ 2), where d denotes dimension and α the power-law… (More)
Is this relevant?
2007
2007
We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A… (More)
Is this relevant?
2002
2002
A self-avoiding walk with small attractive interactions is described here. The existence of the connective constant is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2001
2001
We have developed a transfer matrix algorithm for the enumeration of compact self-avoiding walks on rectangular strips of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
1994
1994
We present a polynomial time Monte Carlo algorithm for almost uniformly generating and approximately counting self-avoiding walks… (More)
  • figure 2
Is this relevant?
1993
1993
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the… (More)
Is this relevant?