2000 character limit reached
Quantitative sub-ballisticity of self-avoiding walk on the hexagonal lattice
Published 26 Oct 2023 in math.PR, math-ph, and math.MP | (2310.17299v1)
Abstract: We prove quantitative sub-ballisticity for the self-avoiding walk on the hexagonal lattice. Namely, we show that with high probability a self-avoiding walk of length $n$ does not exit a ball of radius $O(n/\log{n})$. Previously, only a non-quantitative $o(n)$ bound was known from the work of Duminil-Copin and Hammond \cite{DCH13}. As an important ingredient of the proof we show that at criticality the partition function of bridges of height $T$ decays polynomially fast to $0$ as $T$ tends to infinity, which we believe to be of independent interest.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.