Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices

DOI10.1088/0305-4470/38/10/001zbMath1060.82019OpenAlexW2040632682MaRDI QIDQ4668933

Sven Erick Alm

Publication date: 15 April 2005

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/17863725272f56f85b6ace259e9b8724f7db96b3

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Spatial mixing and the connective constant: optimal bounds, Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models, Bounds on connective constants of regular graphs