Self-avoiding walk is ballistic on graphs with more than one end

Florian Lehner, Christian Lindorfer, Christoforos Panagiotis

We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist…