The self-avoiding walk.
From MaRDI portal
Collected or selected works; reprintings or translations of classics (01A75) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Interacting random processes; statistical mechanics type models; percolation theory (60K35) 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) Statistical mechanics of polymers (82D60)
Cited in
(39)- Self-avoiding walk in five or more dimensions. I: The critical behaviour
- Self-avoiding walks with writhe
- Models of random knots
- A Hopf algebra for counting cycles
- The Hammersley-Welsh bound for self-avoiding walk revisited
- Vertex reinforced non-backtracking random walks: an example of path formation
- Enumerating simple paths from connected induced subgraphs
- A method for the enumeration of various classes of column-convex polygons
- A general bridge theorem for self-avoiding walks
- Scaling properties of a moving polymer
- On the derivation of mean-field percolation critical exponents from the triangle condition
- Asymptotic height distribution in high-dimensional sandpiles
- Self-avoiding walk on nonunimodular transitive graphs
- Random walks avoiding their convex hull with a finite memory
- Self-attracting self-avoiding walk
- Capacity of the range of random walk on \(\mathbb{Z}^{4}\)
- Robust importance sampling with adaptive winsorization
- The quenched critical point for self-avoiding walk on random conductors
- Self-limiting trajectories of a particle moving deterministically in a random medium
- scientific article; zbMATH DE number 1024108 (Why is no real title available?)
- Adsorbing staircase polygons subject to a force
- Random walk problems motivated by statistical physics
- The writhe of a self-avoiding walk
- A Markov Chain Sampler for Plane Curves
- The estimation of the number of p2-tilings of a plane on a polyomino of given area
- Asymptotic laws for random knot diagrams
- Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
- Complex network growth model: possible isomorphism between nonextensive statistical mechanics and random geometry
- Potential-weighted connective constants and uniqueness of Gibbs measures
- Upper bounds for the connective constant of weighted self-avoiding walks
- Step-constrained self-avoiding walks on finite grids
- Self-avoiding walk is ballistic on graphs with more than one end
- The radius of a self-repelling star polymer
- Dominic Welsh, 1938--2023
- Weakly self-avoiding walk in a Pareto-distributed random potential
- The Maker-Breaker percolation game on a random board
- Self-interacting processes via Doob conditioning
- A general coupling for Ising models and beyond
- Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
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)