Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T12:03:08.273Z Has data issue: false hasContentIssue false

On Finite Coding Factors of a Class of Random Markov Chains

Published online by Cambridge University Press:  20 November 2018

M. Rahe*
Affiliation:
Department of Mathematics, Texas A&M University College Station, Texas U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For k-step Markov chains, factors generated by finite length codes split off with Bernoulli complement when maximal in entropy. Those not maximal are relatively finite in another factor which generates or splits off.

These results extend to random Markov chains with finite expected step size, implying that random Markov chains with finite expected step size can have only finitely many ergodic components, each of which is isomorphic to a finite rotation, a Bernoulli shift, or a direct product of a Bernoulli shift with a finite rotation. This result limits the type of zero entropy factors which occur in random Markov chains with finite expected step size, providing a counterpoint to the work of Kalikow, Katznelson, and Weiss, who have shown that each zero entropy process can be embedded in some random Markov chain.

Extending Rudolph and Schwarz, random Markov chains with finite expected step size are limits in of their canonical Markov approximants. The -closure of the class is the Bernoulli cross Generalized Von Neuman processes.

Finitary isomorphism of aperiodic ergodic random Markov chains with finite expected step size is considered.

Applications are made to a class of generalized baker's transformations.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1994