The self-avoiding walk.

DOI10.1007/978-1-4614-6025-1zbMath1254.01051OpenAlexW4252353565MaRDI QIDQ695691

Gordon Slade, Neal Madras

Publication date: 17 December 2012

Published in: Modern Birkhäuser Classics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-6025-1

Mathematics Subject Classification ID

Statistical mechanics of polymers (82D60) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Paths and cycles (05C38) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41) Collected or selected works; reprintings or translations of classics (01A75) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)

Related Items (25)

The quenched critical point for self-avoiding walk on random conductors ⋮ Self-limiting trajectories of a particle moving deterministically in a random medium ⋮ On the derivation of mean-field percolation critical exponents from the triangle condition ⋮ Models of random knots ⋮ A method for the enumeration of various classes of column-convex polygons ⋮ Unnamed Item ⋮ A Markov Chain Sampler for Plane Curves ⋮ Robust importance sampling with adaptive winsorization ⋮ Capacity of the range of random walk on \(\mathbb{Z}^{4}\) ⋮ Adsorbing staircase polygons subject to a force ⋮ A Hopf algebra for counting cycles ⋮ Asymptotic height distribution in high-dimensional sandpiles ⋮ The Hammersley-Welsh bound for self-avoiding walk revisited ⋮ Vertex reinforced non-backtracking random walks: an example of path formation ⋮ Self-avoiding walk in five or more dimensions. I: The critical behaviour ⋮ Enumerating simple paths from connected induced subgraphs ⋮ A general bridge theorem for self-avoiding walks ⋮ Self-avoiding walk on nonunimodular transitive graphs ⋮ Random walks avoiding their convex hull with a finite memory ⋮ Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion ⋮ Self-attracting self-avoiding walk ⋮ Unnamed Item ⋮ Scaling properties of a moving polymer ⋮ Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons ⋮ Asymptotic laws for random knot diagrams

This page was built for publication: The self-avoiding walk.