论文信息 - Approximating Partition Functions of Two-State Spin Systems

Approximating Partition Functions of Two-State Spin Systems

Two-state spin systems is a classical topic in statistical physics. We consider the problem of computing the partition function of the systems on a bounded degree graph. Based on the self-avoiding tree, we prove the systems exhibits strong correlation decay under the condition that the absolute value of "inverse temperature" is small. Due to strong correlation decay property, an FPTAS for the partition function is presented under the same condition. This condition is sharp for Ising model.

Fengshan Bai | Jinshan Zhang | Heng Liang

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

[2] Dror Weitz. Combinatorial criteria for uniqueness of Gibbs measures , 2005 .

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

[4] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[5] D. Shah,et al. Inference in Binary Pair-wise Markov Random Fields through Self-Avoiding Walks , 2006 .

[6] Robin Pemantle,et al. The critical Ising model on trees, concave recursions and nonlinear capacity , 2005, math/0503137.

[7] David Gamarnik,et al. Counting without sampling: new algorithms for enumeration problems using statistical physics , 2006, SODA '06.

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

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

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

[11] J. Jonasson. Uniqueness of uniform random colorings of regular trees , 2002 .

[12] A. Dembo,et al. Ising models on locally tree-like graphs , 2008, 0804.4726.

[13] Elchanan Mossel,et al. Rapid mixing of Gibbs sampling on graphs that are sparse on average , 2007, SODA '08.