The Hammersley-Welsh bound for self-avoiding walk revisited

DOI10.1214/17-ECP94MaRDI QIDQ1748552zbMATHFDO

Authors Tom Hutchcroft

Publication date 11 May 2018

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.09460

zbMATH Keywords

self-avoiding walkHammersley-Welsh bound

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: The Hammersley-Welsh bound (1962) states that the number $c_n$ of length $n$ self-avoiding walks on $mathbb{Z}^d$ satisfies [ c_n leq exp left[ O(n^{1/2}) ight] mu_c^n, ] where $m{u}_c=m{u}_c(d)$ is the connective constant of $mathbb{Z}^d$. While stronger estimates have subsequently been proven for $dgeq3$, for $d=2$ this has remained the best rigorous, unconditional bound available. In this note, we give a new, simplified proof of this bound, which does not rely on the combinatorial analysis of unfolding. We also prove a small, non-quantitative improvement to the bound, namely [ c_n leq expleft[ o(n^{1/2}) ight] mu_c^n. ] The improved bound is obtained as a corollary to the sub-ballisticity theorem of Duminil-Copin and Hammond (2013). We also show that any quantitative form of that theorem would yield a corresponding quantitative improvement to the Hammersley-Welsh bound.

Recommendations

• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
• New lower bounds on the self-avoiding-walk connective constant
• New upper bounds for the connective constants of self-avoiding walks
• Improved lower bounds on the connective constants for two-dimensional self-avoiding walks

Cites work

• scientific article; zbMATH DE number 2154241 (Why is no real title available?)
• scientific article; zbMATH DE number 3088537 (Why is no real title available?)
• Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
• Enumeration of self-avoiding walks on the square lattice
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• Intersections of random walks. A direct renormalization approach
• Lectures on self-avoiding walks
• Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
• On the Number of Self-Avoiding Walks. II
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Self-avoiding walk is sub-ballistic
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• The self-avoiding walk.

Cited in

(5)

• Self-avoiding walk, spin systems and renormalization
• The fixed irreducible bridge ensemble for self-avoiding walks
• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• Self-avoiding walk on nonunimodular transitive graphs
• Weakly self-avoiding walk on a high-dimensional torus

This page was built for publication: The Hammersley-Welsh bound for self-avoiding walk revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748552)