How to compute suitable vicinity parameter and sampling time of recurrence analysis

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

Abstract We show how the maximum of recurrence-mi\-cro\-states entropy configures a new way to properly compute appropriate recurrence vicinity parameter and time sampling to perform recurrence analysis of continuous data. For experimental data, we show the same procedure may be used to find the optimum sampling or to perform down-sampling of the data, preserving recurrence meaning and adjusting the ideal sampling. The new method retrieves results obtained using traditional methods with the advantage of being independent of any free parameter, since all parameter dependencies are automatically set. Our results are also less sensitive to noise when experimental data is used. Due to the automatized way to capture suitable recurrence parameters, the method is adequate for using in autonomous numerical algorithms, allowing the recovery of relevant recurrence information embedded in time series (including over-sampled data), rationalizing the process of data acquisition and allowing only relevant data to be collected.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0