Self-Avoiding Random Walks in 3D
Trace a path by moving at random from one lattice point to another while avoiding previously visited points.
Contributed by:
Rob Morris
Based on a program by:
Todd Rowland
X
X
X
Show Source Code
|
Download Source Code Notebook
Show Initialization Code
Self-Avoiding Walk
(
Wolfram
MathWorld
)
Self-Avoiding Walk Connective Constant
(
Wolfram
MathWorld
)
"
Self-Avoiding Random Walks in 3D
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/SelfAvoidingRandomWalksIn3D/
Contributed by:
Rob Morris
Based on a program by:
Todd Rowland
Chaos Theory
Discrete Mathematics
Discrete Models
Fractals
Generation of Form
Molecular Biology
NKS / Wolfram Science
Random Processes
Self-Avoiding Random Walks
Lattice Random Walk in 3D
Random Branching Process in 3D
Lattice Random Walk in 2D
Random Branching Process
Dendrimer to Linear Polymer Transition
Random 3D Nearest Neighbor Networks
Random Spheres with Power-Law Sizes
Random Circles with Power-Law Sizes
Random 2D Nearest Neighbor Networks
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
