Self-avoiding walk

[mklabgr]

Self-avoiding walk

Summary

A self-avoiding walk (SAW) is a mathematical model of a path that moves randomly on a grid (or lattice) but with one strict rule: it can never visit the same point twice. Imagine a person walking through a city where every street corner they step on disappears behind them, forcing them to explore only new locations. Although the idea is simple, the mathematics becomes surprisingly difficult because the number of possible walks grows extremely quickly and there is no simple formula for counting them. 

Self-avoiding walks are important not only in pure mathematics but also in physics and chemistry, especially for modeling the shapes of long molecules such as polymers, where atoms cannot occupy the same space. Researchers study their statistical properties, fractal-like structures, growth patterns, and how they behave in different dimensions. 

Many results are known through computer simulations and physical intuition, but several fundamental questions remain unsolved, making self-avoiding walks a fascinating example of how a simple rule can create extremely complex behavior.


ARTICLE