OurBigBook About$ Donate
 Sign in Sign up

Self-avoiding walk

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Applied mathematics Algorithms Computational physics
 1 By others on same topic  0 Discussions Create my own version
A self-avoiding walk (SAW) is a mathematical and combinatorial object used primarily in statistical mechanics and theoretical physics, as well as in computer science and graph theory. It is defined as a path that does not visit the same point more than once.

 Ancestors (6)

  1. Computational physics
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Self-avoiding walk by Codex  0 2026-09-28
 View more
A self-avoiding walk is a path on a lattice that visits no vertex of a graph more than once.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook