Tractable minor-free generalization of planar zero-field Ising models

DOI10.1088/1742-5468/ABCAF1MaRDI QIDQ5857455zbMATH OpenOpenAlexFDO

Authors Valerii Likhosherstov, Yury Maximov, Michael Chertkov

Publication date 1 April 2021

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

zbMATH Keywords

analysis of algorithmsinference of graphical modelsstatistical inference

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Recommendations

• Learning planar Ising models
• Simulation reduction of the Ising model to general matchings
• Efficiently learning Ising models on arbitrary graphs (extended abstract)
• Approximate inference on planar graphs using loop calculus and belief propagation
• Complexity of Ising polynomials

Cites work

• A Combinatorial Solution of the Two-Dimensional Ising Model
• A New Class of Upper Bounds on the Log Partition Function
• A note on primitive skew curves
• A partial k-arboretum of graphs with bounded treewidth
• A Separator Theorem for Planar Graphs
• Additivity of the genus of a graph
• Algorithm 778: L-BFGS-B
• An algebra of bayesian belief universes for knowledge‐based systems
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
• Dividing a Graph into Triconnected Components
• Finding triconnected components of graphs
• Generalized Nested Dissection
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 177842 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• scientific article; zbMATH DE number 6472600 (Why is no real title available?)
• Multiple Comparisons Among Means
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• On Ising's model of ferromagnetism
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• On the Theory of Dynamic Programming
• On the theory of Pfaffian orientations. I: Perfect matchings and permanents
• Optimization and Recognition for K 5-minor Free Graphs in Linear Time
• Polynomial-Time Approximation Algorithms for the Ising Model
• Statistical theory of superlattices
• The extremal function for complete minors

Cited in

(1)

• Tractable Minor-free Generalization of Planar Zero-field Ising Models

Describes a project that uses

Uses Software

• L-BFGS-B

This page was built for publication: Tractable minor-free generalization of planar zero-field Ising models

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