alphaFeedback

WorksMathematics

Quantitative sub-ballisticity of self-avoiding walk on Zd\mathbb{Z}^d

Abstract

We prove quantitative sub-ballisticity for the self-avoiding walk on the lattice Zd\mathbb{Z}^d, d≥2d\geq 2. Namely, we obtain an explicit exponential rate of decay for the probability that a self-avoiding walk of length nn reaches distance at least vnvn, in terms of v>0v>0. As a consequence, we show that the displacement of an nn-step self-avoiding walk is at most n/exp⁡(clog⁡∗n)n/\exp(c\log^* n) with very high probability. Previously, only a non-quantitative o(n)o(n) bound was known from the work of Duminil-Copin and Hammond. Along the way, we show that at criticality the partition function of bridges of length nn is on average bounded by C/log⁡log⁡nC/\log\log n, which we believe to be of independent interest. Our approach is based on a quantitative analysis of the original nonconstructive proof of Duminil-Copin and Hammond using ideas from proof theory.

Paper details

vlnc:W_r5zfuxbs
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

arXiv nonexclusive license

Original source

  • Mathematics

OpenAI’s GPT-6 · View statement →

Looking for related papers…