Maximal entropy of markov chains with common steady-state probabilities

Yigal Gerchak*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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 languageEnglish
Pages (from-to)233-234
Number of pages2
JournalJournal of the Operational Research Society
Volume32
Issue number3
DOIs
StatePublished - Mar 1981
Externally publishedYes

Fingerprint

Dive into the research topics of 'Maximal entropy of markov chains with common steady-state probabilities'. Together they form a unique fingerprint.

Cite this