Averaged recurrence quantification analysis: method omitting the recurrence threshold choice

Journal article

Abstract:: Recurrence quantification analysis (RQA) is a well established method of nonlinear data analysis. In this work, we present a new strategy for an almost parameter-free RQA. The approach finally omits the choice of the threshold parameter by calculating the RQA measures for a range of thresholds (in fact recurrence rates). Specifically, we test the ability of the RQA measure determinism, to sort data with respect to their signal to noise ratios. We consider a periodic signal, simple chaotic logistic equation, and Lorenz system in the tested data set with different and even very small signal-to-noise ratios of lengths 102,103,104,102,103,104, and 105105. To make the calculations possible, a new effective algorithm was developed for streamlining of the numerical operations on graphics processing unit (GPU).

Files:: Panis_et_al_2022_Averaged_recurrence_quantification.pdf

(Preview, Version of record, pdf, 1.6MB, Terms of use)

Copyright holder:: Pánis et al.
Rights statement:: © The Author(s) 2022. Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

If you are the owner of this record, you can report an update to it here: Report update to this record