A Monotone Path Proof of an Extremal Result for Long Markov Chains
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON L8S 4K1, Canada
Authors to whom correspondence should be addressed.
Received: 31 January 2019 / Revised: 5 March 2019 / Accepted: 11 March 2019 / Published: 13 March 2019
We prove an extremal result for long Markov chains based on the monotone path argument, generalizing an earlier work by Courtade and Jiao.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Wang, J.; Chen, J. A Monotone Path Proof of an Extremal Result for Long Markov Chains. Entropy 2019, 21, 276.
Wang J, Chen J. A Monotone Path Proof of an Extremal Result for Long Markov Chains. Entropy. 2019; 21(3):276.
Wang, Jia; Chen, Jun. 2019. "A Monotone Path Proof of an Extremal Result for Long Markov Chains." Entropy 21, no. 3: 276.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.