Computing bounds for entropy of stationary Z^d Markov random fields [PDF]
Brian Marcus, Ronnie PavlovFor 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$.View original: http://arxiv.org/abs/1204.2612
No comments:
Post a Comment