Easily Adaptable Complexity Measure for Finite Time Series
Da-Guan Ke, Qin-Ye Tong
Abstract
We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the widely accepted but conflicting criteria for complexity measurements. Surprisingly, the measure is developed from Kolmogorov complexity, which is traditionally believed to represent only randomness and to satisfy one criterion to the exclusion of the others. For familiar iterative systems, our treatment may imply a heuristic approach to transforming symbolic dynamics into permutation dynamics and vice versa.
Create a lesson
Related papers
A comparison of three models of a whirling string as it becomes chaotic
Nicholas B. Tufillaro
Modal interactions in strongly nonlinear coupled oscillators with closely spaced modes and nonclassical damping distribution
C. A. Hubay, T. Kalmar-Nagy, L. Bergman et al.
Nonintegrability theorem on perturbed integrable Hamiltonian dynamical systems with two independent resonances
Nikos Zafeiriadis, Efthymia Meletlidou, Christos Efthymiopoulos et al.
PRISM: Unifying multiphysics optothermal transport and identifiability-guided inference for nanoscale thermal metrology
Yicong Qiu, Ziyang Zhong, Ziyan Qian et al.
Ultraslow diffusion emerging from local symmetry breaking in quenched disorder
Jin Liu, Rainer Klages, Huihai Wang et al.
A model for the dimension of the inertial manifold of the Kuramoto-Sivashinsky equation
Melisa Y. Vinograd, Patricio Clark di Leoni