Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems

We give fully polynomial-time approximation schemes (FPTAS) for the partition function of ferromagnetic 2-spin systems in certain parameter regimes. The threshold we obtain is almost tight up to an integrality gap. Our technique is based on the correlation decay framework. The main technical contribution is a new potential function, with which we establish a new kind of spatial mixing.

[1]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[2]  Pinyan Lu,et al.  The Complexity of Ferromagnetic Two-spin Systems with External Fields , 2014, APPROX-RANDOM.

[3]  Dror Weitz,et al.  Counting independent sets up to the tree threshold , 2006, STOC '06.

[4]  Piyush Srivastava,et al.  Approximation Algorithms for Two-State Anti-Ferromagnetic Spin Systems on Bounded Degree Graphs , 2011, Journal of Statistical Physics.

[5]  Elchanan Mossel,et al.  Exact thresholds for Ising–Gibbs samplers on general graphs , 2009, The Annals of Probability.

[6]  Jin-Yi Cai,et al.  Spin systems on k-regular graphs with complex edge functions , 2012, Theor. Comput. Sci..

[7]  Liang Li,et al.  Approximate counting via correlation decay in spin systems , 2012, SODA.

[8]  Leslie Ann Goldberg,et al.  The computational complexity of two‐state spin systems , 2003, Random Struct. Algorithms.

[9]  Eric Vigoda,et al.  Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models , 2012, Combinatorics, Probability and Computing.

[10]  R. Lyons.  The Ising model and percolation on trees and tree-like graphs , 1989 .

[11]  A. Sinclair,et al.  Spatial mixing and the connective constant: optimal bounds , 2015, SODA 2015.

[12]  Martin E. Dyer,et al.  On the relative complexity of approximate counting problems , 2000, APPROX.

[13]  Allan Sly,et al.  Computational Transition at the Uniqueness Threshold , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[14]  Terrence J. Sejnowski,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cognitive Sciences.

[15]  Leslie Ann Goldberg,et al.  The Complexity of Ferromagnetic Ising with Local Fields , 2006, Combinatorics, Probability and Computing.

[16]  Heng Guo,et al.  Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems , 2018, TOCT.

[17]  Allan Sly,et al.  The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[18]  Liang Li,et al.  Correlation Decay up to Uniqueness in Spin Systems , 2013, SODA.

[19]  Piyush Srivastava,et al.  Spatial mixing and the connective constant: optimal bounds , 2014, SODA.

[20]  Martin E. Dyer,et al.  The Relative Complexity of Approximate Counting Problems , 2000, Algorithmica.

[21]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

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

[23]  Eric Vigoda,et al.  #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region , 2013, J. Comput. Syst. Sci..

[24]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[25]  Fengshan Bai,et al.  Approximating partition functions of the two-state spin system , 2011, Inf. Process. Lett..