arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0309462math.DS
收藏

The Algorithmic Information Content for randomly perturbed systems

Claudio Bonanno

英文摘要:

In this paper we prove estimates on the behaviour of the Kolmogorov-Sinai entropy relative to a partition for randomly perturbed dynamical systems. Our estimates use the entropy for the unperturbed system and are obtained using the notion of Algorithmic Information Content. The main result is an extension of known results to study time series obtained by the observation of real systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑