Computing Bounds for Entropy of Stationary Zd Markov Random Fields

For any stationary $\mZ^d$-Gibbs measure that satisfies strong spatial mixing, we obtain sequences of upper and lower approximations that converge to its entropy. In the case, $d=2$, these approximations are efficient in the sense that the approximations are accurate to within $\epsilon$ and can be computed in time polynomial in $1/\epsilon$.

[1]  David Ruelle,et al.  Thermodynamic Formalism: The Mathematical Structures of Classical Equilibrium Statistical Mechanics , 1978 .

[2]  M. Mirzakhani,et al.  Introduction to Ergodic theory , 2010 .

[3]  Dmitriy Katz,et al.  Strong spatial mixing of list coloring of graphs , 2012, Random Struct. Algorithms.

[4]  Leslie Ann Goldberg,et al.  Strong Spatial Mixing with Fewer Colors for Lattice Graphs , 2005, SIAM J. Comput..

[5]  John P. Moussouris.  Gibbs and Markov random systems with constraints , 1974 .

[6]  C. Preston.  Gibbs States on Countable Sets , 1974 .

[7]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[8]  D. Gamarnik,et al.  Sequential Cavity Method for Computing Free Energy and Surface Pressure , 2008, 0807.1551.

[9]  F. Martinelli.  Lectures on Glauber dynamics for discrete spin models , 1999 .

[10]  F. Papangelou.  GIBBS MEASURES AND PHASE TRANSITIONS (de Gruyter Studies in Mathematics 9) , 1990 .

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

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

[13]  P. L. Dobruschin.  The Description of a Random Field by Means of Conditional Probabilities and Conditions of Its Regularity , 1968 .

[14]  B. Marcus,et al.  Approximating entropy for a class of ℤ2 Markov random fields and pressure for a class of functions on ℤ2 shifts of finite type , 2010, Ergodic Theory and Dynamical Systems.

[15]  Van den Berg,et al.  Disagreement percolation in the study of Markov fields , 1994 .

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

[17]  R. Pavlov.  Approximating the hard square entropy constant with probabilistic methods , 2010, 1011.1983.

[18]  A. Sinclair,et al.  Approximating the number of monomer-dimer coverings of a lattice , 1996 .

[19]  Nishant Chandgotia.  Markov random fields and measures with nearest neighbour Gibbs potential , 2011 .

[20]  H. Poincaré,et al.  Percolation ? , 1982 .