Lectures on self-avoiding walks

MaRDI QIDQ5501410zbMATH OpenFDO

Authors Roland Bauerschmidt, Hugo Duminil-Copin, Jesse Goodman, Gordon Slade

Publication date 3 August 2015

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

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Stochastic (Schramm-)Loewner evolution (SLE) (60J67)

Abstract: These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central problems, an account is given of the Hammersley--Welsh bound on the number of self-avoiding walks and its consequences for the growth rates of bridges and self-avoiding polygons. A detailed proof that the connective constant on the hexagonal lattice equals $sqrt2+sqrt2$ is then provided. The lace expansion for self-avoiding walks is described, and its use in understanding the critical behaviour in dimensions $d>4$ is discussed. Functional integral representations of the self-avoiding walk model are discussed and developed, and their use in a renormalisation group analysis in dimension 4 is sketched. Problems and solutions from tutorials are included.

Recommendations

• scientific article; zbMATH DE number 201032
• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• The self-avoiding walk: a brief survey
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• Self-avoiding walks

Cited in

(45)

• Self-avoiding walk is sub-ballistic
• Self-avoiding walk, spin systems and renormalization
• A local CLT for convolution equations with an application to weakly self-avoiding random walks
• On the speed of the one-dimensional polymer in the large range regime
• Functional integral representations for self-avoiding walk
• A survey on the lace expansion for the nearest-neighbor models on the BCC lattice
• A general bridge theorem for self-avoiding walks
• Lower bounds on the localisation length of balanced random quantum walks
• Supercritical self-avoiding walks are space-filling
• Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
• Positive speed self-avoiding walks on graphs with more than one end
• Self-avoiding walks and multiple context-free languages
• Selected Problems in Probability Theory
• On the probability that self-avoiding walk ends at a given point
• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• Self-attracting self-avoiding walk
• Bounds on connective constants of regular graphs
• Connective constants and height functions for Cayley graphs
• Scaling properties of a moving polymer
• Self-avoiding walks and the Fisher transformation
• On the growth constant for square-lattice self-avoiding walks
• An upper bound on the number of self-avoiding polygons via joining
• The effective radius of self repelling elastic manifolds
• The Hammersley-Welsh bound for self-avoiding walk revisited
• Self-avoiding walks, the language of science, and Fibonacci numbers
• Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
• Constructing discrete harmonic functions in wedges
• Hyperbolic self avoiding walk
• The ABC (in any D) of logarithmic CFT
• Critical two-point function of the 4-dimensional weakly self-avoiding walk
• The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
• Counting self-avoiding walks on free products of graphs
• Cubic graphs and the golden mean
• Three theorems in discrete random geometry
• Self-avoiding walk on nonunimodular transitive graphs
• Self-avoiding walks and connective constants
• Asymptotics of polygons in restricted geometries subject to a force
• Locality of connective constants
• The language of self-avoiding walks
• The renormalization group and self-avoiding walk
• Self-avoiding walks and amenability
• Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps
• On self-avoiding polygons and walks: the snake method via pattern fluctuation
• On self-avoiding polygons and walks: the snake method via polygon joining
• On the radius of self-repellent fractional Brownian motion

This page was built for publication: Lectures on self-avoiding walks

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