4.7 Article

Complexity-based permutation entropies: From deterministic time series to white noise

Publisher

ELSEVIER
DOI: 10.1016/j.cnsns.2021.106077

Keywords

Time series analysis; Deterministic and random real-valued processes; Metric and topological permutation entropy; Permutation complexity classes; Permutation entropy rate for noisy processes; Discrimination of noisy time series; Numerical simulations

Funding

  1. Agencia Estatal de Investigacion, Spain [PID2019-108654GB-I00]
  2. Generalitat Valenciana, Spain [PROMETEO/2021/063]
  3. Ministerio de Ciencia, Innovacion y Universidades, Spain [PGC2018-094898-B-I00]
  4. Severo Ochoa Programme for Centres of Excellence in R&D, Ministerio de Ciencia, Innovacion y Universidades, Spain [CEX2019-000904-S]

Ask authors/readers for more resources

This paper presents new results on permutation complexity and permutation entropy, and introduces a unified approach to ordinal analysis of deterministic and random processes through complexity classes.
This is a paper in the intersection of time series analysis and complexity theory that presents new results on permutation complexity in general and permutation entropy in particular. In this context, permutation complexity refers to the characterization of time series by means of ordinal patterns (permutations), entropic measures, decay rates of missing ordinal patterns, and more. Since the inception of this ordinal methodology, its practical application to any type of scalar time series and real-valued processes have proven to be simple and useful. However, the theoretical aspects have remained limited to noiseless deterministic series and dynamical systems, the main obstacle being the super-exponential growth of allowed permutations with length when randomness (also in form of observational noise) is present in the data. To overcome this difficulty, we take a new approach through complexity classes, which are precisely defined by the growth of allowed permutations with length, regardless of the deterministic or noisy nature of the data. We consider three major classes: exponential, sub-factorial and factorial. The next step is to adapt the concept of Z-entropy to each of those classes, which we call permutation entropy because it coincides with the conventional permutation entropy on the exponential class. Z-entropies are a family of group entropies, each of them extensive on a given complexity class. The result is a unified approach to the ordinal analysis of deterministic and random processes, from dynamical systems to white noise, with new concepts and tools. Numerical simulations show that permutation entropy discriminates time series from all complexity classes. (C) 2021 The Author(s). Published by Elsevier B.V.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available