Chaotic systems share with stochastic processes several properties that make them almost undistinguishable. In this communication we introduce a representation space, to be called the complexity-entropy causality plane. Its horizontal and vertical axis are suitable functionals of the pertinent probability distribution, namely, the entropy of the system and an appropriate statistical complexity measure, respectively. These two functionals are evaluated using the Bandt-Pompe recipe to assign a probability distribution function to the time series generated by the system. Several well-known model-generated time series, usually regarded as being of either stochastic or chaotic nature, are analyzed so as to illustrate the approach. The main achievement of this communication is the possibility of clearly distinguishing between them in our representation space, something that is rather difficult otherwise.

No abstract

Entropy is a powerful tool for the analysis of time series, as it allows describing the probability distributions of the possible state of a system, and therefore the information encoded in it. Nevertheless, important information may be codified also in the temporal dynamics, an aspect which is not usually taken into account. The idea of calculating entropy based on permutation patterns (that is, permutations defined by the order relations among values of a time series) has received a lot of attention in the last years, especially for the understanding of complex and chaotic systems. Permutation entropy directly accounts for the temporal information contained in the time series; furthermore, it has the quality of simplicity, robustness and very low computational cost. To celebrate the tenth anniversary of the original work, here we analyze the theoretical foundations of the permutation entropy, Entropy 2012, 14 1554 as well as the main recent applications to the analysis of economical markets and to the understanding of biomedical systems.

No abstract

No abstract

No abstract

No abstract

In this paper an approach to identify delay phenomena from time series is developed. We show that it is possible to perform a reliable time delay identification by using quantifiers derived from information theory, more precisely, permutation entropy and permutation statistical complexity. These quantifiers show clear extrema when the embedding delay τ of the symbolic reconstruction matches the characteristic time delay τ(S) of the system. Numerical data originating from a time delay system based on the well-known Mackey-Glass equations operating in the chaotic regime were used as test beds. We show that our method is straightforward to apply and robust to additive observational and dynamical noise. Moreover, we find that the identification of the time delay is even more efficient in a noise environment. Our permutation approach is also able to recover the time delay in systems with low feedback rate or high nonlinearity.