Entropy at a weight-per-symbol and embeddings of Markov chains
Given a finite directed graph and a vector-valued labelling f of its edges, we give a formula for the growth rate of the number of cycles whose average f-value equals a prescribed number. We use this to prove a generalization of Krieger's imbedding theorem (a coding theorem for topological Markov chains) to probabilistic Markov chains.
generalization of Krieger's imbedding theorem
coding theorem for topological Markov chains
scientific article; zbMATH DE number 4156841
scientific article