New Graph Polynomials from the Bethe Approximation of the Ising Partition Function

DOI10.1017/S0963548310000258zbMath1209.05126arXiv0908.3850OpenAlexW2963085998MaRDI QIDQ3081334

Yûsuke Watanabe, Kenji Fukumizu

Publication date: 7 March 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

graph polynomialBethe approximationIsing partition functiondeletion-contraction relationsV-function

Mathematics Subject Classification ID

Graph polynomials (05C31)

Related Items (4)

A Tutte Polynomial for Maps ⋮ On the Potts model partition function in an external field ⋮ Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs ⋮ Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic polynomial, \(q\)-binomial counting and colored Jones function
• The bivariate Ising polynomial of a graph
• Topology of finite graphs
• Counting connected graphs inside-out
• Contraction-deletion invariants for graphs
• Zeta functions of finite graphs and coverings
• A new subgraph expansion for obtaining coloring polynomials for graphs
• Theory of monomer-dimer systems
• Loop calculus in statistical physics and information science
• Loop series for discrete statistical models on graphs
• Loop series expansion with propagation diagrams
• On the theory of the matching polynomial
• A Tutte Polynomial for Coloured Graphs
• Statistical theory of superlattices
• Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation

This page was built for publication: New Graph Polynomials from the Bethe Approximation of the Ising Partition Function