On the Gaussianity of Kolmogorov Complexity of Mixing Sequences
From MaRDI portal
Publication:5211667
DOI10.1109/TIT.2019.2934454zbMath1434.94038arXiv1702.01317OpenAlexW2968605232MaRDI QIDQ5211667
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.01317
convergence ratecentral limit theoremstationary ergodic processesmixing conditionsShannon's conditional entropy
Central limit and other weak theorems (60F05) Ergodicity, mixing, rates of mixing (37A25) Measures of information, entropy (94A17)
This page was built for publication: On the Gaussianity of Kolmogorov Complexity of Mixing Sequences