A Potts/Ising correspondence on thin graphs

DOI10.1088/0305-4470/32/27/304MaRDI QIDQ4947663zbMATH OpenOpenAlexFDO

Authors

Publication date 25 April 2000

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

Full work available at URL https://arxiv.org/abs/cond-mat/9901142

zbMATH Keywords

\(q\)-state Potts criticalitybond vertex modelIsing modelsrandom graphsthin random graphs

Mathematics Subject Classification ID

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

Abstract: We note that it is possible to construct a bond vertex model that displays q-state Potts criticality on an ensemble of phi3 random graphs of arbitrary topology, which we denote as ``thin random graphs in contrast to the fat graphs of the planar diagram expansion. Since the four vertex model in question also serves to describe the critical behaviour of the Ising model in field, the formulation reveals an isomorphism between the Potts and Ising models on thin random graphs. On planar graphs a similar correspondence is present only for q=1, the value associated with percolation.

Recommendations

• Potts models on Feynman diagrams
• Ising and Potts models on quenched random gravity graphs.
• Equivalence of ferromagnetic spin models on trees and random graphs

Cited in

(6)

• Criticality of measures on 2-d Ising configurations: from square to hexagonal graphs
• On Dependency Graphs and the Lattice Gas
• Potts models on Feynman diagrams
• Equivalence of ferromagnetic spin models on trees and random graphs
• Ising and Potts models on quenched random gravity graphs.
• Vertex models on Feynman diagrams

This page was built for publication: A Potts/Ising correspondence on thin graphs

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