Computing bounds for entropy of stationary Z^d Markov random fields

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Computing bounds for entropy of stationary Z^d Markov random fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing bounds for entropy of stationary Z^d Markov random fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing bounds for entropy of stationary Z^d Markov random fields will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-311740

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.