Abstract
We conceive a new recurrence quantifier for time series based on the concept of information entropy, in which the probabilities are associated with the presence of microstates defined on the recurrence matrix as small binary submatrices. The new methodology to compute the entropy of a time series has advantages compared to the traditional entropies defined in the literature, namely, a good correlation with the maximum Lyapunov exponent of the system and a weak dependence on the vicinity threshold parameter. Furthermore, the new method works adequately even for small segments of data, bringing consistent results for short and long time series. In a case where long time series are available, the new methodology can be employed to obtain high precision results since it does not demand large computational times related to the analysis of the entire time series or recurrence matrices, as is the case of other traditional entropy quantifiers. The method is applied to discrete and continuous systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Chaos: An Interdisciplinary Journal of Nonlinear Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
