An algorithm for simplified recurrence analysis
Recurrence analysis applications are hindered by several issues including the selection of critical parameters, noise sensitivity, computational complexity, or the analysis of non-stationary systems. Great progresses have been made by the community to address these issues individually, yet the diversity of resulting techniques with often additional parameters as well as a lack of consensus still impedes its use by nonspecialists. We present a procedure for simplified recurrence analysis based on compact recurrence plots with automatized parameter selection and enhanced noise robustness, and that are suited to the analysis of complex non-stationary systems. This approach aims at supporting the expansion of recurrence analysis for currently challenging or future applications such as for large systems, on-site studies, or using machine learning. The method is demonstrated on both synthetic and real data showing promising results.
Authors
- Toshihiko Nakata (ORCID: https://orcid.org/0000-0003-0088-9498)
- Rémi Delage (ORCID: https://orcid.org/0000-0002-9101-0970)
Institutions
- Tohoku University (JP)
Publication Details
- Journal
- Chaos An Interdisciplinary Journal of Nonlinear Science
- Published
- 2024-09-01
- DOI
- https://doi.org/10.1063/5.0225465
- Citations
- 2
- Primary Topic
- Fractal and DNA sequence analysis
- Type
- article
- Field-Weighted Citation Impact
- 0.47