Compression and diffusion: a joint approach to detect complexity.
From MaRDI portal
Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Measures of information, entropy (94A17) Time series analysis of dynamical systems (37M10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Classical dynamic and nonequilibrium statistical mechanics (general) (82C05)
Abstract: The adoption of the Kolmogorov-Sinai (KS) 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.
Recommendations
- Compression of Multivariate Discrete Measures and Applications
- Compressibility and Kolmogorov complexity
- scientific article; zbMATH DE number 1779212
- Compressibility and uniform complexity
- Methods and applications of algorithmic complexity. Beyond statistical lossless compression
- Dimension, entropy rates, and compression
- An entropy based measure for comparing distributions of complexity
Cites work
- scientific article; zbMATH DE number 3844071 (Why is no real title available?)
- scientific article; zbMATH DE number 1865707 (Why is no real title available?)
- An Introduction to Chaos in Nonequilibrium Statistical Mechanics
- Computational information for the logistic map at the chaos threshold
- Dynamic versus thermodynamic approach to non-canonical equilibrium
- Entropic nonextensivity: A possible measure of complexity
- Fractal geometry: what is it, and what does it do?
- Information and dynamical systems: A concrete measurement on sporadic dynamics
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Lévy statistics in coding and non-coding nucleotide sequences
- Non-extensive thermodynamics and stationary processes of localization
- On the Relation between Master Equations and Random Walks and Their Solutions
- Orbit complexity and data compression
- Orbit complexity by computable structures
- Pointwise information entropy for metric spaces
- Sporadic randomness, Maxwell's demon and the Poincaré recurrence times
- Sporadicity: Between periodic and chaotic dynamical behaviors
- Stochastic versus dynamic approach to Lévy statistics in the presence of an external perturbation
- The complexity of the logistic map at the chaos threshold
- Time evolution of thermodynamic entropy for conservative and dissipative chaotic maps
Cited in
(20)- Toward a dynamical model for prime numbers
- From knowledge, knowability and the search for objective randomness to a new vision of complexity
- Density approach to ballistic anomalous diffusion: an exact analytical treatment
- Multiresolution diffusion entropy analysis of time series: an application to births to teenagers in Texas
- On the analysis of fluctuating velocity signals through methods based on the wavelet and Hilbert transforms
- Stromatolites: Why do we care?
- Towards the timely detection of toxicants
- Complementarity of information obtained by Kolmogorov and Aksentijevic-Gibson complexities in the analysis of binary time series
- Ergodicity breakdown and scaling from single sequences
- Complexity analysis to explore the structure of ancient stromatolites
- Maximizing information exchange between complex networks
- COMPLEXITY, MULTIRESOLUTION, NON-STATIONARITY AND ENTROPIC SCALING: TEEN BIRTH THERMODYNAMICS
- Distribution with a simple Laplace transform and its applications to non-Poissonian stochastic processes
- A study of complexity in Gamma Ray Burst using the Diffusion Entropy approach
- In the search for the low-complexity sequences in prokaryotic and eukaryotic genomes: How to derive a coherent picture from global and local entropy measures
- Automated chirp detection with diffusion entropy: Application to infrasound from sprites
- SCALING BEHAVIOR AND COMPLEXITY OF THE PORTEVIN-LE CHATELIER EFFECT
- Criticality and avalanches in neural networks
- Emergence of biological complexity: criticality, renewal and memory
- Intermittency and scale-free networks: a dynamical model for human language complexity
This page was built for publication: Compression and diffusion: a joint approach to detect complexity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1419144)
