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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An algorithm for simplified recurrence analysis

Toshihiko Nakata, Rémi Delage
2 citations
Chaos An Interdisciplinary Journal of Nonlinear Science
Fractal and DNA sequence analysis
0.47
article

An algorithm for simplified recurrence analysis

Toshihiko Nakata, Rémi Delage
article en
2 citations

Abstract

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.

Chaos An Interdisciplinary Journal of Nonlinear ScienceVol. 34(9)
Tohoku University (JP)
Openalex Percentile: Top 35%
Fractal and DNA sequence analysis
0.47
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An algorithm for simplified recurrence analysis — Toshihiko Nakata, Rémi Delage · Chaos An Interdisciplinary Journal of Nonlinear Science (2024) | TGRS Research Map | TGRS