Self-Avoiding Random Walks

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Trace a path by moving at random from one lattice point to another while avoiding previously visited points.


Such self-avoiding random walks can be used to model the path taken by an object, for example a person walking around and placing land mines at various locations. That person would not want to return to any previously visited site. It can also be a model for an animal moving around marking its territory and not wanting to return to a spot it has already marked, the foraging behavior of animals or birds, and so on. Another kind of example would be a particle moving subject to certain spatial restrictions; technically these are called spatially restricted diffusion processes or Brownian motion with spatial restrictions.


Contributed by: Rob Morris (May 2008)
Open content licensed under CC BY-NC-SA



To describe a long-chain molecule, another algorithm must be used, the pivot algorithm; see Self-avoiding walk.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.