Lectures on self-avoiding walks
From MaRDI portal
Publication:5501410
zbMATH Open1317.60125arXiv1206.2092MaRDI QIDQ5501410FDOQ5501410
Authors: Roland Bauerschmidt, Hugo Duminil-Copin, Jesse Goodman, Gordon Slade
Publication date: 3 August 2015
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 is then provided. The lace expansion for self-avoiding walks is described, and its use in understanding the critical behaviour in dimensions 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.
Full work available at URL: https://arxiv.org/abs/1206.2092
Recommendations
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)
Cited In (45)
- Self-avoiding walks and multiple context-free languages
- Self-avoiding walks, the language of science, and Fibonacci numbers
- Cubic graphs and the golden mean
- Self-avoiding walk on nonunimodular transitive graphs
- Self-avoiding walks and the Fisher transformation
- Three theorems in discrete random geometry
- Lower bounds on the localisation length of balanced random quantum walks
- Bounds on connective constants of regular graphs
- Self-avoiding walk, spin systems and renormalization
- Self-attracting self-avoiding walk
- On the growth constant for square-lattice self-avoiding walks
- The ABC (in any D) of logarithmic CFT
- On self-avoiding polygons and walks: the snake method via polygon joining
- 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
- A general bridge theorem for self-avoiding walks
- Selected Problems in Probability Theory
- On the probability that self-avoiding walk ends at a given point
- Self-avoiding walk is sub-ballistic
- Functional integral representations for self-avoiding walk
- The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
- Supercritical self-avoiding walks are space-filling
- Scaling properties of a moving polymer
- Counting self-avoiding walks on free products of graphs
- The effective radius of self repelling elastic manifolds
- Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
- Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps
- Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
- Critical two-point function of the 4-dimensional weakly self-avoiding walk
- Connective constants and height functions for Cayley graphs
- Asymptotics of polygons in restricted geometries subject to a force
- Positive speed self-avoiding walks on graphs with more than one end
- The renormalization group and self-avoiding walk
- The language of self-avoiding walks
- Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
- Self-avoiding walks and amenability
- Locality of connective constants
- On self-avoiding polygons and walks: The snake method via pattern fluctuation
- Hyperbolic self avoiding walk
- Self-avoiding walks and connective constants
- On the radius of self-repellent fractional Brownian motion
- A survey on the lace expansion for the nearest-neighbor models on the BCC lattice
- An upper bound on the number of self-avoiding polygons via joining
- The Hammersley-Welsh bound for self-avoiding walk revisited
- Constructing discrete harmonic functions in wedges
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)