Yes. Simple random walk in two dimensions is recurrent, so a walk started at hits almost surely and its loop erasure is a finite path. Exhaust by finite boxes, or use increasingly large tori with the marked vertices kept fixed. The probability that either walk reaches the boundary before hitting its target tends to zero by recurrence. The finite-graph reversal identity from part 2 therefore passes to the limit:
Articles by others on the same topic
There are currently no matching articles.