Entropy of random symbolic high-order bilinear Markov chains
Statistical Mechanics
2019-08-01 v1 Data Analysis, Statistics and Probability
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.
Keywords
Cite
@article{arxiv.1709.06642,
title = {Entropy of random symbolic high-order bilinear Markov chains},
author = {S. S. Melnik and O. V. Usatenko},
journal= {arXiv preprint arXiv:1709.06642},
year = {2019}
}
Comments
8 pages. arXiv admin note: text overlap with arXiv:1412.3692