Refine
Has Fulltext
- no (24)
Year of publication
- 2009 (24) (remove)
Document Type
- Article (24) (remove)
Language
- English (24)
Is part of the Bibliography
- yes (24)
In the recent article "Stochastic analysis of recurrence plots with applications to the detection of deterministic signals" (Physica D 237 (2008) 619-629), Rohde et al. stated that the performance of RQA in order to detect deterministic signals would be below traditional and well-known detectors. However, we have concerns about such a general statement. Based on our own studies we cannot confirm their conclusions. Our findings suggest that the measures of complexity provided by RQA are useful detectors outperforming well-known traditional detectors, in particular for the detection of signals of complex systems, with phase differences or signals modified due to the measurement process.
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.
The EEG is one of the most commonly used tools in brain research. Though of high relevance in research, the data obtained is very noisy and nonstationary. In the present article we investigate the applicability of a nonlinear data analysis method, the recurrence quantification analysis (RQA), to Such data. The method solely rests on the natural property of recurrence which is a phenomenon inherent to complex systems, such as the brain. We show that this method is indeed suitable for the analysis of EEG data and that it might improve contemporary EEG analysis.
Complex networks in climate dynamics : comparing linear and nonlinear network construction methods
(2009)
Complex network theory provides a powerful framework to statistically investigate the topology of local and non- local statistical interrelationships, i.e. teleconnections, in the climate system. Climate networks constructed from the same global climatological data set using the linear Pearson correlation coefficient or the nonlinear mutual information as a measure of dynamical similarity between regions, are compared systematically on local, mesoscopic and global topological scales. A high degree of similarity is observed on the local and mesoscopic topological scales for surface air temperature fields taken from AOGCM and reanalysis data sets. We find larger differences on the global scale, particularly in the betweenness centrality field. The global scale view on climate networks obtained using mutual information offers promising new perspectives for detecting network structures based on nonlinear physical processes in the climate system.