Positive speed self-avoiding walks on graphs with more than one end

Zhongyang Li

A self-avoiding walk (SAW) is a path on a graph that visits each vertex at most once. The mean square displacement of an $n$-step SAW is the expected value of the square of the dis…