Self-avoiding walks and the Fisher transformation

zbMATH Open1295.05123arXiv1208.5019MaRDI QIDQ396887FDOQ396887

Authors: G. R. Grimmett, Zhongyang Li 

Publication date: 14 August 2014

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

Abstract: The Fisher transformation acts on cubic graphs by replacing each vertex by a triangle. We explore the action of the Fisher transformation on the set of self-avoiding walks of a cubic graph. Iteration of the transformation yields a sequence of graphs with common critical exponents, and with connective constants converging geometrically to the golden mean. We consider the application of the Fisher transformation to one of the two classes of vertices of a bipartite cubic graph. The connective constant of the ensuing graph may be expressed in terms of that of the initial graph. When applied to the hexagonal lattice, this identifies a further lattice whose connective constant may be computed rigorously.

Full work available at URL: https://arxiv.org/abs/1208.5019

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Self-avoiding walks and connective constants
• Cubic graphs and the golden mean
• Counting self-avoiding walks on free products of graphs
• scientific article; zbMATH DE number 201032
• Self-avoiding walk on nonunimodular transitive graphs

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)

Cites Work

• Title not available (Why is that?)
• Lectures on self-avoiding walks
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• Critical temperature of periodic Ising models
• Local statistics of realizable vertex models
• The critical \(Z\)-invariant Ising model via dimers: Locality property
• Title not available (Why is that?)
• Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
• Three theorems in discrete random geometry
• Bounds on connective constants of regular graphs

Cited In (12)

• Self-avoiding walks, the language of science, and Fibonacci numbers
• Cubic graphs and the golden mean
• Self-avoiding walk on nonunimodular transitive graphs
• Bounds on connective constants of regular graphs
• Counting self-avoiding walks on free products of graphs
• The smart kinetic self-avoiding walk and Schramm Loewner evolution
• Connective constants and height functions for Cayley graphs
• Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models
• Positive speed self-avoiding walks on graphs with more than one end
• Locality of connective constants
• Self-avoiding walks and connective constants
• Spectral curves of periodic Fisher graphs

This page was built for publication: Self-avoiding walks and the Fisher transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396887)