Self-avoiding walk is sub-ballistic

Abstract

We prove that self-avoiding walk on Z^d is sub-ballistic in any dimension d at least two. That is, writing ||u|| for the Euclidean norm of u \in Z^d, and SAW_n for the uniform measure on self-avoiding walks gamma:{0,...,n} \to Z^d for which gamma_0 = 0, we show that, for each v > 0, there exists c > 0 such that, for each positive integer n, SAW_n (max {|| gamma_k || : k \in {0,...,n}} > v n) < e^{- c n}.

27 pages and four figures

References in corpus (2)

• Lectures on Self-Avoiding Walks
• Functional integral representations for self-avoiding walk

Cited by in corpus (16)

• Transport properties and first arrival statistics of random searches with stochastic reset times
• Introduction to a renormalisation group method
• Self-avoiding walk, spin systems, and renormalization
• On the probability that self-avoiding walk ends at a given point
• Positive speed self-avoiding walks on graphs with more than one end
• Weakly self-avoiding walk on a high-dimensional torus
• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• The critical surface fugacity of self-avoiding walks on a rotated honeycomb lattice
• Self avoiding walk on the seven regular triangulation
• Non-coincidence of Quenched and Annealed Connective Constants on the supercritical planar percolation cluster
• On the existence of critical exponents for self-avoiding walks
• Critical behaviour of the extended-ballistic transition for pulled self-avoiding walks
• Stratified Splitting for Efficient Monte Carlo Integration
• Self-avoiding walk is ballistic on graphs with more than one end
• Hyperbolic self avoiding walk
• Sub-ballisticity of self-repelling polymers in Z^d