Self-avoiding walks

DOI10.1007/BF03026612zbMath0795.60065MaRDI QIDQ1323033

Gordon Slade

Publication date: 10 May 1994

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

zbMATH Keywords

critical exponents; percolation; self-avoiding walks; Monte Carlo methods; lattice animals

Mathematics Subject Classification ID

60G50: Sums of independent random variables; random walks

82D60: Statistical mechanics of polymers

82B41: Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics

Related Items

The drift of a one-dimensional self-repellent random walk with bounded increments, Scaling limits of loop-erased random walks and uniform spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-avoiding walk in 5 or more dimensions
• Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
• Self-avoiding walk on a hierarchical lattice in four dimensions
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• New lower bounds on the self-avoiding-walk connective constant
• Monotonicity of the number of self-avoiding walks
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• Upper Bounds for the Connective Constant of Self-Avoiding Walks
• Lower bound on the connective constant for square lattice self-avoiding walks
• Algebraic techniques for enumerating self-avoiding walks on the square lattice
• On the Number of Self-Avoiding Walks. II
• Birkhoff for Lovelock redux
• On the Number of Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE