Indexed metadata

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

Ekin Arikök, Christoforos Panagiotis, Nicholas Pischke, Thomas Powell

Source record

Source: arXiv

Published: Oct 29, 2026

arXiv: 2610.40520

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Quantitative sub-ballisticity of self-avoiding walk on $\mathbb{Z}^d$ — Mathematical Frontier Network