Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)

zbMath1034.82023MaRDI QIDQ1977368

André Pönitz, Peter Tittmann

Publication date: 11 May 2000

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/123421

zbMATH Keywords

connective constant

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Asymptotic enumeration (05A16)

Related Items (8)

Spatial mixing and the connective constant: optimal bounds ⋮ On the number of planar Eulerian orientations ⋮ Non-backtracking random walk ⋮ Improved mixing condition on the grid for counting and sampling independent sets ⋮ Self-Avoiding Walks and Connective Constants ⋮ Weak minimization of DFA -- an algorithm and applications ⋮ Entropy-driven phase transition in low-temperature antiferromagnetic Potts models ⋮ The lightning model

This page was built for publication: Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)