The ordinal Kolmogorov-Sinai entropy: A generalized approximation

J.S. Armand Eyebe Fouda 1, * Wolfram Koepf 2, * Sabir Jacquir 3, *
* Auteur correspondant
1 Département de physique (Faculté des sciences, Université de Yaoundé 1)
2 Institut für Mathematik [Kassel]
3 Le2i - Laboratoire Electronique, Informatique et Image [UMR6303]
Abstract : We introduce the multi-dimensional ordinal arrays complexity as a generalized approximation of the ordinal Komogorov-Sinai entropy. The ordinal arrays entropy (OAE) is defined as the Shannon entropy of a series of m-ordinal patterns encoded symbols, while the ordinal arrays complexity (OAC) is defined as the differential of the OAE with respect to m. We theoretically establish that the OAC provides a better estimate of the complexity measure for short length time series. Simulations were carried out using discrete maps, and confirm the efficiency of the OAC as complexity measure from a small data set even in a noisy environment. (C) 2016 Elsevier B.V. All rights reserved.
Keywords : Chaos Discrete Maps Quasi-Periodic Route Permutation Entropy Complexity Entropy Ordinal pattern Ordinal array
Type de document :
Article dans une revue
Liste complète des métadonnées
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01442696
Contributeur : Le2i - Université de Bourgogne <>
Soumis le : vendredi 20 janvier 2017 - 19:46:16
Dernière modification le : mercredi 12 septembre 2018 - 01:26:31

Identifiants

Collections

UNIV-BOURGOGNE | CNRS | INSMI | LE2I | TDS-MACS | ICB | UNIV-HESAM

Citation

J.S. Armand Eyebe Fouda, Wolfram Koepf, Sabir Jacquir. The ordinal Kolmogorov-Sinai entropy: A generalized approximation. Communications in Nonlinear Science and Numerical Simulation, Elsevier, 2017, 46, pp.103 - 115. ⟨10.1016/j.cnsns.2016.11.001⟩. ⟨hal-01442696⟩

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

197

Contact

CCSD