Information theory in random fields
A random field is a family of random variables with a multidimensional parameter set. Random fields provide mathematical models for distributed sources of information. Channels that link an input and an output random field also are of interest.
First, we describe in detail a celebrated result of random field theory to the effect that a random field has the Markov property if and only if it is a Gibbs state with a nearest neighbor potential. Next we lower bound the zero-error capacity of a certain binary random field channel by developing an efficient zero-error coding scheme. Finally, we consider algorithms for computing the stationary distribution of a time evolution mechanism. These algorithms, which have long been employed in mathematical statistical mechanics, also play a central role in simulated annealing.
KeywordsSimulated Annealing Random Field Input Pattern Markov Random Field Channel System
Unable to display preview. Download preview PDF.
- C. J. Preston, Gibbs States on Countable Sets, Cambridge Tracts, Cambridge University Press, 1974.Google Scholar
- B. Hajek and T. Berger, ”A Decomposition Theorem for Binary Markov Random Fields, Annals of Probability, vol. 15, no. 3, pp. 1112–1125, July 1987.Google Scholar
- S. Kirkpatrick, et al., Optimization by Simulated Annealing, Science, vol. 220, pp. 671–679, 1983.Google Scholar
- B. Hajek, Cooling Schedules for Simulated Annealing, preprint, University of Illinois, Coordinated Science Laboratory, submitted to Mathematics of Operations Research.Google Scholar