Scaling behaviour of entropy estimates

From MaRDI portal
Publication:4534809

DOI10.1088/0305-4470/35/7/308zbMATH Open1008.94010arXivcond-mat/0203409OpenAlexW1989542363MaRDI QIDQ4534809FDOQ4534809


Authors: Thomas Schürmann Edit this on Wikidata


Publication date: 11 June 2002

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: Entropy estimation of information sources is highly non trivial for symbol sequences with strong long-range correlations. The rabbit sequence, related to the symbolic dynamics of the nonlinear circle map at the critical point as well as the logistic map at the Feigenbaum point have been argued to exhibit long memory tails. For both dynamical systems the scaling behavior of the block entropy of order n has been shown to increase like as log(n). In contrast to probabilistic concepts, we investigate the scaling behavior of certain non-probabilistic entropy estimation schemes suggested by Lempel and Ziv in the context of algorithmic complexity and data compression. These are applied in a sequential manner with the scaling variable being the length N of the sequence. We determine the scaling law for the Lempel-Ziv entropy estimate applied to the case of the critical circle map and the logistic map at the Feigenbaum point in a binary partition.


Full work available at URL: https://arxiv.org/abs/cond-mat/0203409




Recommendations





Cited In (8)





This page was built for publication: Scaling behaviour of entropy estimates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534809)