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

DOI10.1214/14-AOP993MaRDI QIDQ282496zbMATH OpenOpenAlexFDO

Authors Hugo Duminil-Copin, Alexander Glazman, Alan Hammond, 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, https://projecteuclid.org/euclid.aop/1457960388

zbMATH Keywords

endpoint delocalizationself-avoiding polygonsself-avoiding walk

Mathematics Subject Classification ID

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

Abstract: We prove two results on the delocalization of the endpoint of a uniform self-avoiding walk on Z^d for d>1. We show that the probability that a walk of length n ends at a point x tends to 0 as n tends to infinity, uniformly in x. Also, for any fixed x in Z^d, this probability decreases faster than n^{-1/4 + epsilon} for any epsilon >0. When |x|= 1, we thus obtain a bound on the probability that self-avoiding walk is a polygon.

Recommendations

• Probability distribution of random walks on self-avoiding walks
• scientific article; zbMATH DE number 706385
• A lower bound for the end-to-end distance of self-avoiding walk
• Random self-avoiding walks on one-dimensional lattices
• scientific article; zbMATH DE number 4103108
• End patterns of self-avoiding walks
• Random walk on the self-avoiding tree
• Self-avoiding random walks and Olbers' paradox
• Self-avoiding walks in quenched random environments

Cites work

• scientific article; zbMATH DE number 2154241 (Why is no real title available?)
• scientific article; zbMATH DE number 201032 (Why is no real title available?)
• A lower bound for the end-to-end distance of self-avoiding walk
• A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
• Connective constant for a weighted self-avoiding walk on \(\mathbb{Z}^2\)
• Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
• Critical behaviour of self-avoiding walk in five or more dimensions
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• Functional integral representations for self-avoiding walk
• Lectures on self-avoiding walks
• On the Number of Self-Avoiding Walks
• Polygons and the lace expansion
• Renormalisation group analysis of weakly self-avoiding walk in dimensions four and higher
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Self-avoiding walk is sub-ballistic
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\)
• The writhe of a self-avoiding polygon

Cited in

(11)

• Self-avoiding walk on nonunimodular transitive graphs
• On self-avoiding polygons and walks: the snake method via polygon joining
• scientific article; zbMATH DE number 706385 (Why is no real title available?)
• Self-avoiding walk is sub-ballistic
• How to Estimate the Number of Self-Avoiding Walks over 10100? Use Random Walks
• On self-avoiding polygons and walks: the snake method via pattern fluctuation
• End patterns of self-avoiding walks
• A lower bound for the end-to-end distance of self-avoiding walk
• Self-avoiding walks and connective constants
• An upper bound on the number of self-avoiding polygons via joining
• On the existence of critical exponents for self-avoiding walks

This page was built for publication: On the probability that self-avoiding walk ends at a given point

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