A self-avoiding random walk (or self-avoiding walk, or SAW) is a path on a d-dimensional lattice in Zd 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→∞ are still open, and the models display a rich variety of critical behavior.
This is the n→0 specialization of the O(N) model. This model is an example of a logarithmic CFT, which are non-unitarity.