Hostname: page-component-77c89778f8-m8s7h Total loading time: 0 Render date: 2024-07-16T20:53:39.371Z Has data issue: false hasContentIssue false

A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli

Published online by Cambridge University Press:  13 August 2009

Daniel J. Rudolph
Affiliation:
Department of Mathematics, University of Maryland, College Park, Maryland 20742
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.

We here show that the necessary condition of exponentially decaying first return times to a cylinder set is also sufficient for a countable state Markov chain to be almost continuously isomorphic to a Bernoulli shift.

Type
Research Article
Copyright
Copyright © Cambridge University Press 1982

References

REFERENCES

[1]Kemeny, J. G., Snell, J. L. & Knapp, A. W.. Denumerable Markov Chains. Springer Verlag: Berlin, 1976.CrossRefGoogle Scholar
[2]Petit, B., Deux Schémas de Bernoulli d'alphabet dénombrable et de même entropie sont finitairement isomorphe. Preprint.Google Scholar
[3]Rudolph, D.. A characterization of those processes finitarily isomorphic to a Bernoulli shift. Proceedings of the Special year in Ergodic Theory and Dynamic Systems. University of Maryland, 1980.CrossRefGoogle Scholar
[4]Smorodinsky, M.. β-automorphisms are Bernoulli shifts. Acta. Math. Acad. Sci. Hungar. 24 (1973), 273278.CrossRefGoogle Scholar
[5]Smorodinsky, M. & Keane, M.. Finitary isomorphisms of irreducible Markov shifts. Israel J. Math. 34 (1979), 281286.Google Scholar
[6]Smorodinsky, M., Shields, P. & Adler, R.. Irreducible Markov shifts. Ann. Math. Statist. 43 (1972), 10271029.Google Scholar
[7]Thouvenot, J. P., Quelques propriétés des systèmes dynamiques qui se décomposent en un produit de deux systèmes dont l'un est un schéma de Bernoulli. Israel J. Math. 21 (1975), 177207.Google Scholar