Information flow in one-dimensional Markov systems
HTML articles powered by AMS MathViewer
- by D. A. Dawson PDF
- Proc. Amer. Math. Soc. 43 (1974), 383-392 Request permission
Abstract:
The information flow in discrete Markov systems provides a method for determining that such a system has a unique invariant measure. Estimates are obtained for the information flow and conditions under which there is a unique invariant measure for a one-dimensional Markov system are obtained.References
- Norman Abramson, Informantion theory and coding, McGraw-Hill Book Co., New York-Toronto-London, 1963. MR 0189890
- D. A. Dawson, Information flow in discrete Markov systems, J. Appl. Probability 10 (1973), 63–83. MR 353501, DOI 10.1017/s0021900200042091
- William Feller, An introduction to probability theory and its applications. Vol. II, John Wiley & Sons, Inc., New York-London-Sydney, 1966. MR 0210154
- O. N. Stavskaja and I. I. Pjateckiĭ-Šapiro, Homogeneous networks of spontaneously active elements, Problemy Kibernet. No. 20 (1968), 91–106 (Russian). MR 0286511
Additional Information
- © Copyright 1974 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 43 (1974), 383-392
- MSC: Primary 60J10
- DOI: https://doi.org/10.1090/S0002-9939-1974-0336818-8
- MathSciNet review: 0336818