Entropy at a weight-per-symbol and embeddings of Markov chains (Q917731)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entropy at a weight-per-symbol and embeddings of Markov chains |
scientific article |
Statements
Entropy at a weight-per-symbol and embeddings of Markov chains (English)
0 references
1990
0 references
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.
0 references
entropy
0 references
weight-per-symbol
0 references
Langford-Ruelle variational principle
0 references
sofic systems
0 references
\(\beta \) -functions
0 references
shifts of finite type
0 references
cycles
0 references
generalization of Krieger's imbedding theorem
0 references
coding theorem for topological Markov chains
0 references
probabilistic Markov chains
0 references
0 references
