Self-avoiding walks and the Fisher transformation
From MaRDI portal
Publication:396887
zbMath1295.05123arXiv1208.5019MaRDI QIDQ396887
Geoffrey R. Grimmett, Zhongyang Li
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.5019
05C30: Enumeration in graph theory
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
Cites Work
- Unnamed Item
- Unnamed Item
- Three theorems in discrete random geometry
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Bounds on connective constants of regular graphs
- Local statistics of realizable vertex models
- The critical \(Z\)-invariant Ising model via dimers: Locality property
- Critical temperature of periodic Ising models
- Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
- Lectures on Self-Avoiding Walks