Entropy of random symbolic high-order bilinear Markov chains
arXiv:1709.06642 · doi:10.1016/j.physa.2018.04.025
Abstract
The main goal of this paper is to develop an estimate for the entropy of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We present here the detailed analytical study of the entropy for the high-order Markov chain in the bilinear approximation. The appendix contains a short comprehensive introduction into the subject of study.
arXiv comment8 pages. arXiv admin note: text overlap with arXiv:1412.3692
References in corpus (5)
- Anomalous Localization in Low-Dimensional Systems with Correlated Disorder
- Symbolic stochastic dynamical systems viewed as binary N-step Markov chains
- Competition between Two Kinds of Correlations in Literary Texts
- Memory functions and Correlations in Additive Binary Markov Chains
- Decomposition of conditional probability for high-order symbolic Markov chains