Strong laws for recurrence quantification analysis

From MaRDI portal
Publication:2864982

DOI10.1142/S0218127413501472zbMATH Open1275.37012arXiv1302.1734MaRDI QIDQ2864982FDOQ2864982


Authors: M. Grendár, J. Majerová, Vladimír Špitalský Edit this on Wikidata


Publication date: 27 November 2013

Published in: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1302.1734




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Strong laws for recurrence quantification analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864982)