On the scaling limit of planar self-avoiding walk

Gregory F. Lawler, Oded Schramm, Wendelin Werner

A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no sel…