Approximability of the eight-vertex model

We initiate a study of the classification of approximation complexity of the eight-vertex model defined over 4-regular graphs. The eight-vertex model, together with its special case the six-vertex model, is one of the most extensively studied models in statistical physics, and can be stated as a problem of counting weighted orientations in graph theory. Our result concerns the approximability of the partition function on all 4-regular graphs, classified according to the parameters of the model. Our complexity results conform to the phase transition phenomenon from physics. We introduce a quantum decomposition of the eight-vertex model and prove a set of closure properties in various regions of the parameter space. Furthermore, we show that there are extra closure properties on 4-regular planar graphs. These regions of the parameter space are concordant with the phase transition threshold. Using these closure properties, we derive polynomial time approximation algorithms via Markov chain Monte Carlo. We also show that the eight-vertex model is NP-hard to approximate on the other side of the phase transition threshold.

[1]  F. Jaeger.  On Transition Polynomials of 4-Regular Graphs , 1990 .

[2]  Mark Jerrum.  Sampling and counting , 2003 .

[3]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  F. Stillinger,et al.  Proton Distribution in Ice and the Kirkwood Correlation Factor , 1972 .

[5]  F. Y. Wu,et al.  General Lattice Model of Phase Transitions , 1970 .

[6]  R. Baxter.  Eight-Vertex Model in Lattice Statistics , 1971 .

[7]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[8]  M. .. Moore.  Exactly Solved Models in Statistical Mechanics , 1983 .

[9]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[10]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[11]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[12]  R. Baxter.  Partition function of the eight vertex lattice model , 1972 .

[13]  Peter Winkler,et al.  On the number of Eulerian orientations of a graph , 1996 .

[14]  B. Sutherland.  Exact Solution of a Two-Dimensional Model for Hydrogen-Bonded Crystals , 1967 .

[15]  DyerMartin,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991 .

[16]  Dana Randall,et al.  Slow Mixing of Markov Chains Using Fault Lines and Fat Contours , 2010, Algorithmica.

[17]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[18]  B. Sutherland.  Two-Dimensional Hydrogen Bonded Crystals without the Ice Rule , 1970 .

[19]  Michel Las Vergnas,et al.  On the evaluation at (3, 3) of the Tutte polynomial of a graph , 1988, J. Comb. Theory, Ser. B.

[20]  Colin McQuillan.  Approximating Holant problems by winding , 2013, ArXiv.

[21]  Monte Carlo simulation of ice models , 1997, cond-mat/9706190.

[22]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[23]  Jin-Yi Cai,et al.  Complexity Classification of the Eight-Vertex Model , 2017, Inf. Comput..

[24]  J. Nagle,et al.  Calculations of correlation functions for two-dimensional square ice , 1979 .

[25]  P. Lu,et al.  Approximability of the Six-vertex Model , 2017, SODA.