Self-avoiding walks and the Fisher transformation

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

zbMATH Keywords

cubic graphself-avoiding walkquasi-transitive graphconnective constantFisher transformation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models, Spectral curves of periodic Fisher graphs, Connective constants and height functions for Cayley graphs, Self-Avoiding Walks and Connective Constants, Bounds on connective constants of regular graphs, Cubic graphs and the golden mean, Self-avoiding walk on nonunimodular transitive graphs, Counting self-avoiding walks on free products of graphs, Locality of connective constants, Positive speed self-avoiding walks on graphs with more than one end

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