On the probability that self-avoiding walk ends at a given point
Abstract
We prove two results on the delocalization of the endpoint of a uniform self-avoiding walk on Zd for d>1. We show that the probability that a walk of length n ends at a point x tends to 0 as n tends to infinity, uniformly in x. Also, for any fixed x in Zd, this probability decreases faster than n-1/4 + epsilon for any epsilon >0. When |x|= 1, we thus obtain a bound on the probability that self-avoiding walk is a polygon.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.