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, as well as the main recent applications to the analysis of economical markets and to the understanding of biomedical systems.

In this paper we introduce a multiscale symbolic information-theory approach for discriminating nonlinear deterministic and stochastic dynamics from time series associated with complex systems. More precisely, we show that the multiscale complexity-entropy causality plane is a useful representation space to identify the range of scales at which deterministic or noisy behaviors dominate the system's dynamics. Numerical simulations obtained from the well-known and widely used Mackey-Glass oscillator operating in a high-dimensional chaotic regime were used as test beds. The effect of an increased amount of observational white noise was carefully examined. The results obtained were contrasted with those derived from correlated stochastic processes and continuous stochastic limit cycles. Finally, several experimental and natural time series were analyzed in order to show the applicability of this scale-dependent symbolic approach in practical situations.

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 $\tau$ of the symbolic reconstruction matches the characteristic time delay ${\tau }_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.