Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion

DOI10.1214/19-AOP1400zbMath1453.60154arXiv1809.00760MaRDI QIDQ782398

Shirshendu Ganguly, Ioan Manolescu, Alan Hammond, Hugo Duminil-Copin

Publication date: 27 July 2020

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

self-avoiding walkHammersley-Welsh bound

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (4)

Weakly self-avoiding walk on a high-dimensional torus ⋮ Harry Kesten's work in probability theory ⋮ Self-avoiding walk, spin systems and renormalization ⋮ On the existence of critical exponents for self-avoiding walks

Cites Work

• Unnamed Item
• Unnamed Item
• Self-avoiding walk is sub-ballistic
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• The self-avoiding walk.
• The scaling limit of self-avoiding random walk in high dimensions
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
• An upper bound on the number of self-avoiding polygons via joining
• The Hammersley-Welsh bound for self-avoiding walk revisited
• The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\)
• Discrete Complex Analysis and Probability
• Lectures on Self-Avoiding Walks
• On the Number of Self-Avoiding Walks. II
• On the Number of Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE

This page was built for publication: Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion