arXiv · 1204.2612
Computing bounds for entropy of stationary Z^d Markov random fields
Abstract
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$.
Explore related subjects
Keep this discovery
Brian Marcus, Ronnie Pavlov. 2012-04-12. Computing bounds for entropy of stationary Z^d Markov random fields. https://arxiv.org/abs/1204.2612
Cite the original work for its findings. Save a collection to share your selection of sources.