Abstract
It is proved that of all Markov chains with common steady-state probabilities the one whose entropy is largest is the one whose rows are all equal to the steady-state probabilities.
Original language | English |
---|---|
Pages (from-to) | 233-234 |
Number of pages | 2 |
Journal | Journal of the Operational Research Society |
Volume | 32 |
Issue number | 3 |
DOIs | |
State | Published - Mar 1981 |
Externally published | Yes |