Quantifying the dynamical complexity of time series
arXiv:1610.05959 · doi:10.1103/PhysRevLett.118.144101
Abstract
A powerful tool is developed for the characterization of chaotic signals. The approach is based on the symbolic encoding of time series (according to their ordinal patterns) combined with the ensuing characterization of the corresponding cylinder sets. Quantitative estimates of the Kolmogorov-Sinai entropy are obtained by introducing a modified permutation entropy which takes into account the average width of the cylinder sets. The method works also in hyperchaotic systems and allows estimating the fractal dimension of the underlying attractors.
5 pages - 4 figures
References in corpus (1)
Cited by in corpus (14)
- 20 years of ordinal patterns: Perspectives and challenges
- Permutation Jensen-Shannon distance: A versatile and fast symbolic tool for complex time series analysis
- Visibility graphs and symbolic dynamics
- Cross and joint ordinal partition transition networks for multivariate time series analysis
- Permutation entropy revisited
- Correlation dimension and phase space contraction via extreme value theory
- Symbolic analysis of bursting dynamical regimes of Rulkov neural networks
- Dynamical complexity as a proxy for the network degree distribution
- Exploiting the impact of ordering patterns in the Fisher-Shannon complexity plan
- Symbolic dynamics techniques for complex systems: Application to share price dynamics
- On the predictability of infectious disease outbreaks
- Including the magnitude variability of a signal into the ordinal pattern analysis
- Exploring the robustness of permutation entropy analysis to differentiate between closed-eyes and open-eyes resting states
- A simple method for detecting chaos in nature