Hostname: page-component-7f64f4797f-rcs6z Total loading time: 0 Render date: 2025-11-03T20:45:09.681Z Has data issue: false hasContentIssue false
  • English
  • Français

Information flow in some classes of Markov systems

Published online by Cambridge University Press:  14 July 2016

D. A. Dawson
D. A. Dawson*
Affiliation:
Carleton University, Ottawa
Get access Rights & Permissions [Opens in a new window]

Abstract

The information flow in discrete Markov systems provides a method for determining that such a system is ergodic. Estimates are obtained for the information flow in some classes of Markov systems and using these estimates criteria for the ergodicity of the systems are established.

Keywords

DISCRETE MARKOV SYSTEMSTATIONARY MEASUREINFORMATION FLOW

Information

Type
Short Communications
Information
Journal of Applied Probability , Volume 11 , Issue 3 , September 1974 , pp. 594 - 600
Copyright
Copyright © Applied Probability Trust 1974 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Dawson, D. A. (1973) Information flow in discrete Markov systems. J. Appl. Prob. 10, 63–83.Google Scholar
[2] Dawson, D. A. (1973) Information flow in one-dimensional Markov systems. Proc. Amer. Math. Soc., to appear.Google Scholar
[3] Vasserstein, L. N. (1969) Markov processes on denumerable products of spaces describing large systems automata. Problemy Peredachi Informatsii 5, 64–72.Google Scholar