Monotonicity of the number of self-avoiding walks

DOI10.1007/BF01025858zbMath0718.60080MaRDI QIDQ2639438

George L. O'Brien

Publication date: 1990

Published in: Journal of Statistical Physics (Search for Journal in Brave)

zbMATH Keywords

self-avoiding walks

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Related Items (3)

Self-testing algorithms for self-avoiding walks ⋮ History and Introduction to Polygon Models and Polyominoes ⋮ Self-avoiding walks

Cites Work

• The diffusion of self-avoiding random walk in high dimensions
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• On the Number of Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE

This page was built for publication: Monotonicity of the number of self-avoiding walks