The Algorithmic Information Content for randomly perturbed systems

Simple item page
dc.creatorBonanno, Claudio
dc.date2003-09-29
dc.date.accessioned2026-07-07T05:01:31Z
dc.date.available2026-07-07T05:01:31Z
dc.descriptionIn 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.
dc.description17 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0309462
dc.identifierhttp://arxiv.org/abs/math/0309462
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68701
dc.subjectDynamical Systems
dc.subject28D20; 37A50; 37M25; 60H40
dc.titleThe Algorithmic Information Content for randomly perturbed systems
dc.typetext

Files

Collections

arXiv