The self-avoiding walk.

DOI10.1007/978-1-4614-6025-1MaRDI QIDQ695691zbMATH OpenOpenAlexFDO

Authors Neal Madras, Gordon Slade

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

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

Cited in

(30)

• Asymptotic laws for random knot diagrams
• Self-avoiding walk on nonunimodular transitive graphs
• Vertex reinforced non-backtracking random walks: an example of path formation
• Random walk problems motivated by statistical physics
• The estimation of the number of \(p2\)-tilings of a plane on a polyomino of given area
• Self-attracting self-avoiding walk
• Asymptotic height distribution in high-dimensional sandpiles
• A general bridge theorem for self-avoiding walks
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• The writhe of a self-avoiding walk
• Random walks avoiding their convex hull with a finite memory
• Enumerating simple paths from connected induced subgraphs
• Self-avoiding walks with writhe
• The quenched critical point for self-avoiding walk on random conductors
• scientific article; zbMATH DE number 1024108 (Why is no real title available?)
• Scaling properties of a moving polymer
• A method for the enumeration of various classes of column-convex polygons
• Capacity of the range of random walk on \(\mathbb{Z}^{4}\)
• Robust importance sampling with adaptive winsorization
• Models of random knots
• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
• Potential-weighted connective constants and uniqueness of Gibbs measures
• On the derivation of mean-field percolation critical exponents from the triangle condition
• Adsorbing staircase polygons subject to a force
• A Markov Chain Sampler for Plane Curves
• Self-limiting trajectories of a particle moving deterministically in a random medium
• A Hopf algebra for counting cycles
• The Hammersley-Welsh bound for self-avoiding walk revisited
• Complex network growth model: possible isomorphism between nonextensive statistical mechanics and random geometry

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

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