Lectures on Self-Avoiding Walks

zbMath1317.60125arXiv1206.2092MaRDI QIDQ5501410

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

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)

Related Items (40)

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 ⋮ Self-avoiding walks and multiple context-free languages ⋮ On the probability that self-avoiding walk ends at a given point ⋮ The language of self-avoiding walks ⋮ Constructing discrete harmonic functions in wedges ⋮ Self-avoiding walk is sub-ballistic ⋮ Connective constants and height functions for Cayley graphs ⋮ Self-avoiding walks and amenability ⋮ Self-avoiding walks and the Fisher transformation ⋮ Selected Problems in Probability Theory ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ On self-avoiding polygons and walks: the snake method via polygon joining ⋮ On the radius of self-repellent fractional Brownian motion ⋮ The effective radius of self repelling elastic manifolds ⋮ A survey on the lace expansion for the nearest-neighbor models on the BCC lattice ⋮ Three theorems in discrete random geometry ⋮ The ABC (in any D) of logarithmic CFT ⋮ Supercritical self-avoiding walks are space-filling ⋮ Self-Avoiding Walks and Connective Constants ⋮ An upper bound on the number of self-avoiding polygons via joining ⋮ The Hammersley-Welsh bound for self-avoiding walk revisited ⋮ Bounds on connective constants of regular graphs ⋮ A general bridge theorem for self-avoiding walks ⋮ Cubic graphs and the golden mean ⋮ Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps ⋮ Self-avoiding walk on nonunimodular transitive graphs ⋮ Counting self-avoiding walks on free products of graphs ⋮ Locality of connective constants ⋮ Unnamed Item ⋮ The Renormalization Group and Self-avoiding Walk ⋮ On self-avoiding polygons and walks: The snake method via pattern fluctuation ⋮ Hyperbolic self avoiding walk ⋮ Positive speed self-avoiding walks on graphs with more than one end ⋮ Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion ⋮ Lower bounds on the localisation length of balanced random quantum walks ⋮ Self-attracting self-avoiding walk ⋮ Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis ⋮ Scaling properties of a moving polymer ⋮ Critical two-point function of the 4-dimensional weakly self-avoiding walk

This page was built for publication: Lectures on Self-Avoiding Walks