Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantifying the dynamical complexity of time series

Published 19 Oct 2016 in nlin.CD | (1610.05959v1)

Abstract: A powerful tool is developed for the characterization of chaotic signals. The approach is based on the symbolic encoding of time series (according to their ordinal patterns) combined with the ensuing characterization of the corresponding cylinder sets. Quantitative estimates of the Kolmogorov-Sinai entropy are obtained by introducing a modified permutation entropy which takes into account the average width of the cylinder sets. The method works also in hyperchaotic systems and allows estimating the fractal dimension of the underlying attractors.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.