DOE OSTI · 956353
Planar graphical models which are easy
Abstract
We describe a rich family of binary variables statistical mechanics models on planar graphs which are equivalent to Gaussian Grassmann Graphical models (free fermions). Calculation of partition function (weighted counting) in the models is easy (of polynomial complexity) as reduced to evaluation of determinants of matrixes linear in the number of variables. In particular, this family of models covers Holographic Algorithms of Valiant and extends on the Gauge Transformations discussed in our previous works.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Chertkov, Michael, Chernyak, Vladimir. 2009-01-01. Planar graphical models which are easy. https://www.osti.gov/biblio/956353
Cite the original work for its findings. Save a collection to share your selection of sources.