This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
self_avoiding_walk [2021/04/12 20:14] Scott Lawrence [Self-avoiding walk] |
self_avoiding_walk [2021/11/13 13:29] (current) Brian McPeak [External links] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Self-avoiding walk ====== | ====== Self-avoiding walk ====== | ||
| - | {{tag> | + | {{tag> |
| - | This is the $n\rightarrow 0$ specialization of the [[on_model]]. | + | A self-avoiding random walk (or self-avoiding walk, or SAW) is a path on a $d$-dimensional lattice in $\mathbb{Z}^d$ which never visits the same point more than once. As a statistical model, they are defined as the set of all such paths with length $n$ weighted with equal probability. A number of questions concerning their behavior as $n \to \infty$ are still open, and the models display a rich variety of critical behavior. |
| + | |||
| + | This is the $n\rightarrow 0$ specialization of the [[on_model]]. This model is an example of a logarithmic CFT, which are non-unitarity. | ||
| ===== External links ===== | ===== External links ===== | ||
| * [[https:// | * [[https:// | ||
| + | * see[[https:// | ||
| + | * see [[https:// | ||
| + | * see [[https:// | ||