Quantifying entropy using recurrence matrix microstates

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.