Strong laws for recurrence quantification analysis
classification
🧮 math.DS
math.PRnlin.CD
keywords
recurrenceanalysisdeterminismlawsquantificationratestrongbasic
read the original abstract
The recurrence rate and determinism are two of the basic complexity measures studied in the recurrence quantification analysis. In this paper, the recurrence rate and determinism are expressed in terms of the correlation sums, and strong laws of large numbers are given for them.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.