The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains

DOI10.1017/S0143385700006052zbMath0725.60071MaRDI QIDQ5203451

Brian Marcus, Selim Tuncel

Publication date: 1991

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

zbMATH Keywords

Markov chainBernoulli shiftMarkov shiftsfinite equivalenceblock homomorphism

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (max. 100)

Strong shift equivalence theory and the shift equivalence problem ⋮ Pseudo-Anosov foliations on periodic surfaces ⋮ Stochastic forms of non-negative matrices and Perron-regularity ⋮ Boundary measures of Markov chains ⋮ Path methods for strong shift equivalence of positive matrices ⋮ Relative growth in hyperbolic groups ⋮ Degeneracy in the length spectrum for metric graphs ⋮ Entropy at a weight-per-symbol and embeddings of Markov chains ⋮ Comparing dynamical systems by a graph matching method ⋮ Rotation, entropy, and equilibrium states ⋮ Finite group extensions of shifts of finite type: -theory, Parry and Livšic ⋮ Strong shift equivalence and positive doubly stochastic matrices ⋮ On Automorphisms of Markov Chains ⋮ Algebraic Shift Equivalence and Primitive Matrices ⋮ Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains ⋮ Eigenvectors and ratio limit theorems for Markov chains and their relatives ⋮ Flow equivalence of G-SFTs ⋮ Transitivity of surface dynamics lifted to Abelian covers ⋮ Spanning tree invariants, loop systems and doubly stochastic matrices ⋮ Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts ⋮ The spectra of nonnegative integer matrices via formal power series ⋮ Constructing finitary isomorphisms with finite expected coding times ⋮ Rotation and entropy

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Natural coefficients and invariants for Markov-shifts
• Invariants for finitary isomorphisms with finite expected code lengths
• Limit eigenvalues of nonnegative matrices
• Positive polynomials, convex integral polytopes, and a random walk problem
• Conditional pressure and coding
• Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
• Classification of subshifts of finite type
• Non-negative matrices and Markov chains.
• Linear algebra and subshifts of finite type
• A Dimension, Dimension Modules, and Markov Chains
• On the finitary isomorphisms of markov shifts that have finite expected coding time
• On the Stochastic and Topological Structure of Markov Chains
• An Invariant for Continuous Factors of Markov Shifts
• Endomorphisms of irreducible subshifts of finite type

This page was built for publication: The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains