The adoption of the Kolmogorov–Sinai entropy is becoming a popular research tool among physicists, especially when applied to a dynamical system fitting the conditions of validity of the Pesin theorem. The study of time series that are a manifestation of system dynamics whose rules are either unknown or too complex for a mathematical treatment, is still a challenge since the KS entropy is not computable, in general, in that case. Here we present a plan of action based on the joint action of two procedures, both related to the KS entropy, but compatible with computer implementation through fast and efficient programs. The former procedure, called compression algorithm sensitive to regularity (CASToRE), establishes the amount of order by the numerical evaluation of algorithmic compressibility. The latter, called complex analysis of sequences via scaling and randomness assessment (CASSANDRA), establishes the complexity degree through the numerical evaluation of the strength of an anomalous effect. This is the departure, of the diffusion process generated by the observed fluctuations, from ordinary Brownian motion. The CASSANDRA algorithm shares with CASToRE a connection with the Kolmogorov complexity. This makes both algorithms especially suitable to study the transition from dynamics to thermodynamics, and the case of non-stationary time series as well. The benefit of the joint action of these two methods is proven by the analysis of artificial sequences with the same main properties as the real time series to which the joint use of these two methods will be applied in future research work

Compression and diffusion: a joint approach to detect complexity

Grigolini P;
2003

Abstract

The adoption of the Kolmogorov–Sinai entropy is becoming a popular research tool among physicists, especially when applied to a dynamical system fitting the conditions of validity of the Pesin theorem. The study of time series that are a manifestation of system dynamics whose rules are either unknown or too complex for a mathematical treatment, is still a challenge since the KS entropy is not computable, in general, in that case. Here we present a plan of action based on the joint action of two procedures, both related to the KS entropy, but compatible with computer implementation through fast and efficient programs. The former procedure, called compression algorithm sensitive to regularity (CASToRE), establishes the amount of order by the numerical evaluation of algorithmic compressibility. The latter, called complex analysis of sequences via scaling and randomness assessment (CASSANDRA), establishes the complexity degree through the numerical evaluation of the strength of an anomalous effect. This is the departure, of the diffusion process generated by the observed fluctuations, from ordinary Brownian motion. The CASSANDRA algorithm shares with CASToRE a connection with the Kolmogorov complexity. This makes both algorithms especially suitable to study the transition from dynamics to thermodynamics, and the case of non-stationary time series as well. The benefit of the joint action of these two methods is proven by the analysis of artificial sequences with the same main properties as the real time series to which the joint use of these two methods will be applied in future research work
Campo DC Valore Lingua
dc.authority.orgunit Istituto di linguistica computazionale "Antonio Zampolli" - ILC -
dc.authority.orgunit Istituto per i Processi Chimico-Fisici - IPCF -
dc.authority.people Allegrini P it
dc.authority.people Benci V it
dc.authority.people Grigolini P it
dc.authority.people Hamilton P it
dc.authority.people Ignaccolo M it
dc.authority.people Menconi G it
dc.authority.people Palatella L it
dc.authority.people Raffaelli G it
dc.authority.people Scafetta N it
dc.authority.people Virgilio M it
dc.authority.people Yang J it
dc.collection.id.s b3f88f24-048a-4e43-8ab1-6697b90e068e *
dc.collection.name 01.01 Articolo in rivista *
dc.contributor.appartenenza Istituto per i Processi Chimico-Fisici - IPCF *
dc.contributor.appartenenza.mi 948 *
dc.date.accessioned 2024/02/18 21:10:07 -
dc.date.available 2024/02/18 21:10:07 -
dc.date.issued 2003 -
dc.description.abstract The adoption of the Kolmogorov–Sinai entropy is becoming a popular research tool among physicists, especially when applied to a dynamical system fitting the conditions of validity of the Pesin theorem. The study of time series that are a manifestation of system dynamics whose rules are either unknown or too complex for a mathematical treatment, is still a challenge since the KS entropy is not computable, in general, in that case. Here we present a plan of action based on the joint action of two procedures, both related to the KS entropy, but compatible with computer implementation through fast and efficient programs. The former procedure, called compression algorithm sensitive to regularity (CASToRE), establishes the amount of order by the numerical evaluation of algorithmic compressibility. The latter, called complex analysis of sequences via scaling and randomness assessment (CASSANDRA), establishes the complexity degree through the numerical evaluation of the strength of an anomalous effect. This is the departure, of the diffusion process generated by the observed fluctuations, from ordinary Brownian motion. The CASSANDRA algorithm shares with CASToRE a connection with the Kolmogorov complexity. This makes both algorithms especially suitable to study the transition from dynamics to thermodynamics, and the case of non-stationary time series as well. The benefit of the joint action of these two methods is proven by the analysis of artificial sequences with the same main properties as the real time series to which the joint use of these two methods will be applied in future research work -
dc.description.allpeople Allegrini P.; Benci V.; Grigolini P.; Hamilton P.; Ignaccolo M.; Menconi G.; Palatella L.; Raffaelli G.; Scafetta N.; Virgilio M.; Yang J. -
dc.description.allpeopleoriginal Allegrini P., Benci V., Grigolini P., Hamilton P., Ignaccolo M., Menconi G., Palatella L., Raffaelli G., Scafetta N., Virgilio M., Yang J. -
dc.description.fulltext none en
dc.description.numberofauthors 1 -
dc.identifier.uri https://hdl.handle.net/20.500.14243/152319 -
dc.relation.firstpage 517 -
dc.relation.lastpage 535 -
dc.relation.volume 15 -
dc.title Compression and diffusion: a joint approach to detect complexity en
dc.type.driver info:eu-repo/semantics/article -
dc.type.full 01 Contributo su Rivista::01.01 Articolo in rivista it
dc.type.miur 262 -
dc.ugov.descaux1 171128 -
iris.orcid.lastModifiedDate 2024/03/01 13:48:06 *
iris.orcid.lastModifiedMillisecond 1709297286027 *
iris.sitodocente.maxattempts 1 -
Appare nelle tipologie: 01.01 Articolo in rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/152319
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact