Correlation Decay up to Uniqueness in Spin Systems

We give a complete characterization of the two-state anti-ferromagnetic spin systems which exhibit strong spatial mixing on general graphs. We show that a two-state anti-ferromagnetic spin system exhibits strong spatial mixing on all graphs of maximum degree at most Δ if and only if the system has a unique Gibbs measure on infinite regular trees of degree up to Δ, where Δ can be either bounded or unbounded. As a consequence, there exists an FPTAS for the partition function of a two-state anti-ferromagnetic spin system on graphs of maximum degree at most Δ when the uniqueness condition is satisfied on infinite regular trees of degree up to Δ. In particular, an FPTAS exists for arbitrary graphs if the uniqueness is satisfied on all infinite regular trees. This covers as special cases all previous algorithmic results for two-state anti-ferromagnetic systems on general-structure graphs. Combining with the FPRAS for two-state ferromagnetic spin systems of Jerrum-Sinclair and Goldberg-Jerrum-Paterson, and the very recent hardness results of Sly-Sun and independently of Galanis-Stefankovic-Vigoda, this gives a complete classification, except at the phase transition boundary, of the approximability of all two-state spin systems, on either degree-bounded families of graphs or family of all graphs.

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

[2]  Dmitriy Katz,et al.  Correlation decay and deterministic FPTAS for counting list-colorings of a graph , 2007, SODA '07.

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

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

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

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

[7]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[8]  A. Sinclair,et al.  Fast mixing for independent sets, colorings, and other models on trees , 2007 .

[9]  Eric Vigoda,et al.  Approximately counting up to four (extended abstract) , 1997, STOC '97.

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

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

[12]  Eric Vigoda,et al.  Improved bounds for sampling colorings , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  D. Gamarnik,et al.  Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models , 2008 .

[14]  Elchanan Mossel,et al.  On the hardness of sampling independent sets beyond the tree threshold , 2007, math/0701471.

[15]  Martin E. Dyer,et al.  On Counting Independent Sets in Sparse Graphs , 2002, SIAM J. Comput..

[16]  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.

[17]  Leslie Ann Goldberg,et al.  A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid , 2011, ICALP.

[18]  Allan Sly,et al.  Uniqueness thresholds on trees versus graphs. , 2007, 0704.2916.

[19]  Martin E. Dyer,et al.  Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs , 2002, RANDOM.

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

[21]  Eric Vigoda,et al.  Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model , 2011, APPROX-RANDOM.

[22]  Martin E. Dyer,et al.  On Markov Chains for Independent Sets , 2000, J. Algorithms.

[23]  David Gamarnik,et al.  Simple deterministic approximation algorithms for counting matchings , 2007, STOC '07.

[24]  Eric Vigoda,et al.  Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.