Self-Avoiding Random Walks


	Trace a path by moving at random from one lattice point to another while avoiding previously visited points. These so-called "self-avoiding random walks" are used in numerous physical models including polymer chains, protein folding and Brownian motion.


	Contributed by: Rob Morris

Self-Avoiding Walk (Wolfram MathWorld)

Self-Avoiding Walk Connective Constant (Wolfram MathWorld)

"Self-Avoiding Random Walks" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/SelfAvoidingRandomWalks/

Contributed by: Rob Morris

Free Download: Mathematica Player--Runs all Demonstrations & more

Chaos Theory
Chemistry
Discrete Mathematics
Discrete Models
Generation of Form
Molecular Biology
Random Processes
Recursion
High School Finite Mathematics
High School Mathematics
High School Statistics
Visual Patterns

Browse all topics

Self-Avoiding Random Walks in 3D
Lattice Random Walk in 3D
Lattice Random Walk in 2D
Random Branching Process in 3D
Random Branching Process
Bifurcations of the Logistic Map
Random 3D Nearest Neighbor Networks
Random 2D Nearest Neighbor Networks
Samples of Random Graphs
Dendrimer to Linear Polymer Transition

Email
Link to URL
Embed
Bookmark

Make a new version of this Demonstration
Upload a new Demonstration

Source page:

Name (optional)

Occupation (optional)

Organization (optional)

I use Mathematica:

often

occasionally

never

Country (optional)
Remember me

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »