On the Stochastic and Topological Structure of Markov Chains

DOI10.1112/blms/14.1.16zbMath0481.28015OpenAlexW1995231299MaRDI QIDQ3937605

William Parry, Selim Tuncel

Publication date: 1982

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/14.1.16

zbMATH Keywords

zeta functionsubshifts of finite typeblock isomorphismclassification of Markov chains up to block isomorphismflow on Markov probabilitiesnon-negative integral combinations of exponential functionsshift equivalence of stochastic matrices

Mathematics Subject Classification ID

Generalized stochastic processes (60G20) Continuous-time Markov processes on discrete state spaces (60J27) Set functions and measures on topological groups or semigroups, Haar measures, invariant measures (28C10) One-parameter continuous families of measure-preserving transformations (28D10)

Related Items

Coalescence and meeting times on \(n\)-block Markov chains, Positivity conditions for polynomials, Regular isomorphism of Markov chains is almost topological, Positivity conditions for polynomials, Infinite-to-One Codes and Markov Measures, Entropy at a weight-per-symbol and embeddings of Markov chains, Finite group extensions of shifts of finite type: -theory, Parry and Livšic, The mathematical research of William Parry FRS, Strong shift equivalence and positive doubly stochastic matrices, The zeta functions of renewal systems, Tiling deformations, cohomology, and orbit equivalence of tiling spaces, Markov measures determine the zeta function, On Automorphisms of Markov Chains, A stochastic analogue of a theorem of Boyle's on almost flow equivalence, The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains, Algebraic Shift Equivalence and Primitive Matrices, On the classification of one-sided Markov chains, Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts, Natural coefficients and invariants for Markov-shifts, Constructing finitary isomorphisms with finite expected coding times