Finitary isomorphisms of irreducible Markov shifts
From MaRDI portal
Publication:1138109
DOI10.1007/BF02760609zbMath0431.28015MaRDI QIDQ1138109
Meir Smorodinsky, Michael S. Keane
Publication date: 1979
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items
The positive-divergence and blowing-up properties ⋮ Finitary codings for the random-cluster model and other infinite-range monotone models ⋮ Hyperbolic structure preserving isomorphisms of Markov shifts. II ⋮ Finitary isomorphisms of renewal point processes and continuous-time regenerative processes ⋮ Dye's theorem in the almost continuous category ⋮ Finitary coding for the sub-critical Ising model with finite expected coding volume ⋮ Natural extensions for piecewise affine maps via Hofbauer towers ⋮ Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 ⋮ Conditional pressure and coding ⋮ Topological conjugacy on the complement of the periodic points ⋮ A note on r-processes ⋮ Finitary coding for the one-dimensional \(T,T^{-1}\) process with drift. ⋮ Any two irreducible Markov chains of equal entropy are finitarily Kakutani equivalent ⋮ Finitary isomorphism of some renewal processes to Bernoulli schemes ⋮ A SCATTERING THEORY FOR MARKOV CHAINS ⋮ Entropy of killed-resurrected stationary Markov chains ⋮ Almost isomorphism for countable state Markov shifts ⋮ PERFECTION IN R-PROCESSES ⋮ Finitary isomorphisms of some infinite entropy Bernoulli flows ⋮ On the existence and nonexistence of finitary codings for a class of random fields ⋮ Finitary isomorphisms of Brownian motions ⋮ Finitary codings for spatial mixing Markov random fields ⋮ On the finitary isomorphisms of markov shifts that have finite expected coding time ⋮ A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli ⋮ Unnamed Item ⋮ Natural coefficients and invariants for Markov-shifts ⋮ Invariants for finitary isomorphisms with finite expected code lengths ⋮ Constructing finitary isomorphisms with finite expected coding times
Cites Work
- Smooth partitions of Anosov diffeomorphisms are weak Bernoulli
- A class of finitary codes
- Bernoulli schemes of the same entropy are finitarily isomorphic
- On isomorphism of weak Bernoulli transformations
- Ergodic automorphisms of \(T^ n\) are Bernoulli shifts
- Finitary codes between Markov processes
- The finitary isomorphism theorem for Markov shifts
- Topological entropy and equivalence of dynamical systems
- Similarity of automorphisms of the torus
- Irreducible Markov Shifts