Self-avoiding walk on a 15×15 square lattice
Self-avoiding walk on a 15×15 square lattice
Self-avoiding walk on a 20x20 square lattice, simulated using sequential Monte Carlo
Self-avoiding walk on a 20x20 square lattice, simulated using sequential Monte Carlo

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. This is a special case of the graph theoretical notion of a path. A self-avoiding polygon (SAP) is a closed self-avoiding walk on a lattice. Very little is known rigorously about the self-avoiding walk from a mathematical perspective, although physicists have provided numerous conjectures that are believed to be true and are strongly supported by numerical simulations.

In computational physics, a self-avoiding walk is a chain-like path in R2 or R3 with a certain number of nodes, typically a fixed step length and has the property that it doesn't cross itself or another walk. A system of SAWs satisfies the so-called excluded volume condition. In higher dimensions, the SAW is believed to behave much like the ordinary random walk.

SAWs and SAPs play a central role in the modeling of the topological and knot-theoretic behavior of thread- and loop-like molecules such as proteins. Indeed, SAWs may have first been introduced by the chemist Paul Flory[1][dubious ] in order to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point.

SAWs are fractals. For example, in d = 2 the fractal dimension is 4/3, for d = 3 it is close to 5/3 while for d ≥ 4 the fractal dimension is 2. The dimension is called the upper critical dimension above which excluded volume is negligible. A SAW that does not satisfy the excluded volume condition was recently studied to model explicit surface geometry resulting from expansion of a SAW.[2]

The properties of SAWs cannot be calculated analytically, so numerical simulations are employed. The pivot algorithm is a common method for Markov chain Monte Carlo simulations for the uniform measure on n-step self-avoiding walks. The pivot algorithm works by taking a self-avoiding walk and randomly choosing a point on this walk, and then applying symmetrical transformations (rotations and reflections) on the walk after the nth step to create a new walk.

Calculating the number of self-avoiding walks in any given lattice is a common computational problem. There is currently no known formula, although there are rigorous methods of approximation.[3][4]


One of the phenomena associated with self-avoiding walks and statistical physics models in general is the notion of universality, that is, independence of macroscopic observables from microscopic details, such as the choice of the lattice. One important quantity that appears in conjectures for universal laws is the connective constant, defined as follows. Let cn denote the number of n-step self-avoiding walks. Since every (n + m)-step self avoiding walk can be decomposed into an n-step self-avoiding walk and an m-step self-avoiding walk, it follows that cn+mcncm. Therefore, the sequence {log cn} is subadditive and we can apply Fekete's lemma to show that the following limit exists:

μ is called the connective constant, since cn depends on the particular lattice chosen for the walk so does μ. The exact value of μ is only known for the hexagonal lattice, where it is equal to:[5]

For other lattices, μ has only been approximated numerically, and is believed not to even be an algebraic number. It is conjectured that[6]

as n → ∞, where μ depends on the lattice, but the power law correction does not; in other words, this law is believed to be universal.

On networks

Self-avoiding walks have also been studied in the context of network theory.[7] In this context, it is customary to treat the SAW as a dynamical process, such that in every time-step a walker randomly hops between neighboring nodes of the network. The walk ends when the walker reaches a dead-end state, such that it can no longer progress to newly un-visited nodes. It was recently found that on Erdős–Rényi networks, the distribution of path lengths of such dynamically grown SAWs can be calculated analytically, and follows the Gompertz distribution.[8]


Consider the uniform measure on n-step self-avoiding walks in the full plane. It is currently unknown whether the limit of the uniform measure as n → ∞ induces a measure on infinite full-plane walks. However, Harry Kesten has shown that such a measure exists for self-avoiding walks in the half-plane. One important question involving self-avoiding walks is the existence and conformal invariance of the scaling limit, that is, the limit as the length of the walk goes to infinity and the mesh of the lattice goes to zero. The scaling limit of the self-avoiding walk is conjectured to be described by Schramm–Loewner evolution with parameter κ = 8/3.

See also


  1. ^ P. Flory (1953). Principles of Polymer Chemistry. Cornell University Press. p. 672. ISBN 9780801401343.
  2. ^ A. Bucksch; G. Turk; J.S. Weitz (2014). "The Fiber Walk: A Model of Tip-Driven Growth with Lateral Expansion". PLOS ONE. 9 (1): e85585. arXiv:1304.3521. Bibcode:2014PLoSO...985585B. doi:10.1371/journal.pone.0085585. PMC 3899046. PMID 24465607.
  3. ^ Hayes B (Jul–Aug 1998). "How to Avoid Yourself" (PDF). American Scientist. 86 (4): 314. doi:10.1511/1998.31.3301.
  4. ^ Liśkiewicz M; Ogihara M; Toda S (July 2003). "The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes". Theoretical Computer Science. 304 (1–3): 129–56. doi:10.1016/S0304-3975(03)00080-X.
  5. ^ Duminil-Copin, Hugo; Smirnov, Stanislav (1 May 2012). "The connective constant of the honeycomb lattice equals sqrt(2+sqrt 2)". Annals of Mathematics. 175 (3): 1653–1665. arXiv:1007.0575. doi:10.4007/annals.2012.175.3.14. S2CID 59164280.
  6. ^ Lawler, Gregory F.; Schramm, Oded; Werner, Wendelin (2004). "On the scaling limit of planar self-avoiding walk". Proceedings of Symposia in Pure Mathematics. American Mathematical Society. 72 (2): 339–364. arXiv:math/0204277. doi:10.1090/pspum/072.2/2112127. ISBN 0-8218-3638-2. S2CID 16710180.
  7. ^ Carlos P. Herrero (2005). "Self-avoiding walks on scale-free networks". Phys. Rev. E. 71 (3): 1728. arXiv:cond-mat/0412658. Bibcode:2005PhRvE..71a6103H. doi:10.1103/PhysRevE.71.016103. PMID 15697654. S2CID 2707668.
  8. ^ Tishby, I.; Biham, O.; Katzav, E. (2016). "The distribution of path lengths of self avoiding walks on Erdős–Rényi networks". Journal of Physics A: Mathematical and Theoretical. 49 (28): 285002. arXiv:1603.06613. Bibcode:2016JPhA...49B5002T. doi:10.1088/1751-8113/49/28/285002. S2CID 119182848.

Further reading

  1. Madras, N.; Slade, G. (1996). The Self-Avoiding Walk. Birkhäuser. ISBN 978-0-8176-3891-7.
  2. Lawler, G. F. (1991). Intersections of Random Walks. Birkhäuser. ISBN 978-0-8176-3892-4.
  3. Madras, N.; Sokal, A. D. (1988). "The pivot algorithm – A highly efficient Monte-Carlo method for the self-avoiding walk". Journal of Statistical Physics. 50 (1–2): 109–186. Bibcode:1988JSP....50..109M. doi:10.1007/bf01022990. S2CID 123272694.
  4. Fisher, M. E. (1966). "Shape of a self-avoiding walk or polymer chain". Journal of Chemical Physics. 44 (2): 616–622. Bibcode:1966JChPh..44..616F. doi:10.1063/1.1726734.