TY  - JOUR
A1  - Schinkel, Stefan
A1  - Marwan, Norbert
A1  - Dimigen, Olaf
A1  - Kurths, Jürgen
T1  - Confidence bounds of recurrence-based complexity measures
N2  - In the recent past, recurrence quantification analysis (RQA) has gained an increasing interest in various research areas. The complexity measures the RQA provides have been useful in describing and analysing a broad range of data. It is known to be rather robust to noise and nonstationarities. Yet, one key question in empirical research concerns the confidence bounds of measured data. In the present Letter we suggest a method for estimating the confidence bounds of recurrence-based complexity measures. We study the applicability of the suggested method with model and real- life data.
Y1  - 2009
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/31897
UR  - http://www.sciencedirect.com/science/journal/03759601
SN  - 0375-9601
ER  -