By appealing to a long list of different nonlinear maps we review the characterization of time series arising from chaotic maps. The main tool for this characterization is the permutation Bandt-Pompe probability distribution function. We focus attention on both local and global characteristics of the components of this probability distribution function. We show that forbidden ordinal patterns (local quantifiers) exhibit an exponential growth for pattern-length range 3 ≤ D ≤ 8, in the case of finite time series data. Indeed, there is a minimum D; min-value such that forbidden patterns cannot appear for D < Dmin. The system’s localization in an entropy-complexity plane (global quantifier) displays typical specific features associated with it...
One of the most important routes to chaos is the chaotic intermittency. However, there are many case...
We call permutation complexity the kind of dynamical complexity captured by any quantity or function...
We show a function that fits well the probability density of return times between two consecutive vi...
By appealing to a long list of different nonlinear maps we review the characterization of ...
By appealing to a long list of different nonlinear maps we review the characterization of time serie...
This paper aims at introducing the Lempel–Ziv permutation complexity vs. permutation entropy plane (...
Chaotic systems share with stochastic processes several properties that make them almost undistingui...
We introduce a representation space to contrast chaotic with stochastic dynamics. Following the comp...
The study of permutation complexity can be envisioned as a new kind of symbolic dynamics whose basic...
One of the most important aspects of time series is their degree of stochasticity vs. chaoticity. Si...
Abstract. We consider a family of chaotic skew tent maps. The skew tent map is a two-parameter, piec...
Bandt and Pompe introduced Permutation Entropy as a complexity measure and has been widely used in t...
Acknowledgements The author wishes to acknowledge G. Giacomelli, M. Mulansky, and L. Ricci for early...
Permutation entropy measures the complexity of a deterministic time series via a data symbolic quant...
We analyze the permutation entropy of deterministic chaotic signals affected by a weak observational...
One of the most important routes to chaos is the chaotic intermittency. However, there are many case...
We call permutation complexity the kind of dynamical complexity captured by any quantity or function...
We show a function that fits well the probability density of return times between two consecutive vi...
By appealing to a long list of different nonlinear maps we review the characterization of ...
By appealing to a long list of different nonlinear maps we review the characterization of time serie...
This paper aims at introducing the Lempel–Ziv permutation complexity vs. permutation entropy plane (...
Chaotic systems share with stochastic processes several properties that make them almost undistingui...
We introduce a representation space to contrast chaotic with stochastic dynamics. Following the comp...
The study of permutation complexity can be envisioned as a new kind of symbolic dynamics whose basic...
One of the most important aspects of time series is their degree of stochasticity vs. chaoticity. Si...
Abstract. We consider a family of chaotic skew tent maps. The skew tent map is a two-parameter, piec...
Bandt and Pompe introduced Permutation Entropy as a complexity measure and has been widely used in t...
Acknowledgements The author wishes to acknowledge G. Giacomelli, M. Mulansky, and L. Ricci for early...
Permutation entropy measures the complexity of a deterministic time series via a data symbolic quant...
We analyze the permutation entropy of deterministic chaotic signals affected by a weak observational...
One of the most important routes to chaos is the chaotic intermittency. However, there are many case...
We call permutation complexity the kind of dynamical complexity captured by any quantity or function...
We show a function that fits well the probability density of return times between two consecutive vi...