On self-avoiding polygons and walks: The snake method via pattern fluctuation

Abstract: For

d g e q 2

and

n i n m a t h b b N

, let

m a t h s f W_{n}

denote the uniform law on self-avoiding walks of length

n

beginning at the origin in the nearest-neighbour integer lattice

m a t h b b Z^{d}

, and write

G a m m a

for a

m a t h s f W_{n}

-distributed walk. We show that the closing probability

that

G a m m a

's endpoint neighbours the origin is at most

n^{- 1 / 2 + o (1)}

in any dimension

d g e q 2

. The method of proof is a reworking of that in [4], which found a closing probability upper bound of

n^{- 1 / 4 + o (1)}

. A key element of the proof is made explicit and called the snake method. It is applied to prove the

n^{- 1 / 2 + o (1)}

upper bound by means a technique of Gaussian pattern fluctuation.

Recommendations

Cites Work

Cited In (5)

This page was built for publication: On self-avoiding polygons and walks: The snake method via pattern fluctuation