On a class of one-sided Markov shifts
| dc.creator | Rubshtein, Ben-Zion | |
| dc.date | 2004-06-03 | |
| dc.date.accessioned | 2026-07-07T05:08:51Z | |
| dc.date.available | 2026-07-07T05:08:51Z | |
| dc.description | We study one-sided Markov shifts, corresponding to positively recurrent Markov chains with countable (finite or infinite) state spaces. The following classification problem is considered: when two one-sided Markov shifts are isomorphic up to a measure preserving isomorphism In this paper we solve the problem for the class of rho-uniform (or finitely rho-Bernoulli) one-sided Markov shifts considered in Ru_6 We show that every ergodic rho-uniform Markov shift T can be represented in a canonical form T = T_G by means of a canonical (uniquely determined by T) stochastic graph G. In the canonical form, two such shifts T_{G_1} and T_{G_2} are isomorphic if and only if their canonical stochastic graphs G_1 and G_2 are isomorphic. | |
| dc.identifier | https://arxiv.org/abs/math/0406059 | |
| dc.identifier | http://arxiv.org/abs/math/0406059 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71424 | |
| dc.subject | Dynamical Systems | |
| dc.subject | Probability | |
| dc.subject | 37A35 (Primary); 60J10 (Secondary) | |
| dc.title | On a class of one-sided Markov shifts | |
| dc.type | text |