On the probability that self-avoiding walk ends at a given point

DOI10.1214/14-AOP993zbMath1347.60131arXiv1305.1257OpenAlexW2962992760MaRDI QIDQ282496

Alan Hammond, Hugo Duminil-Copin, Alexander Glazman, Ioan Manolescu

Publication date: 12 May 2016

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

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

zbMATH Keywords

self-avoiding polygonsself-avoiding walkendpoint delocalization

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (6)

On self-avoiding polygons and walks: the snake method via polygon joining ⋮ Self-Avoiding Walks and Connective Constants ⋮ An upper bound on the number of self-avoiding polygons via joining ⋮ Self-avoiding walk on nonunimodular transitive graphs ⋮ On self-avoiding polygons and walks: The snake method via pattern fluctuation ⋮ 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}\)
• Connective constant for a weighted self-avoiding walk on \(\mathbb{Z}^2\)
• Functional integral representations for self-avoiding walk
• Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
• 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.
• The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\)
• Renormalisation group analysis of weakly self-avoiding walk in dimensions four and higher
• Critical behaviour of self-avoiding walk in five or more dimensions
• Polygons and the Lace Expansion
• The writhe of a self-avoiding polygon
• A Lower Bound for the End-to-End Distance of the Self-Avoiding Walk
• Lectures on Self-Avoiding Walks
• 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: On the probability that self-avoiding walk ends at a given point