Refine
Has Fulltext
- no (2) (remove)
Document Type
- Article (2)
Language
- English (2)
Is part of the Bibliography
- yes (2)
Keywords
- Causality (1)
- Embedding (1)
- Optimization (1)
- Prediction (1)
- Recurrence analysis (1)
- State space reconstruction (1)
- Time series analysis (1)
Institute
- Institut für Geowissenschaften (2) (remove)
A novel idea for an optimal time delay state space reconstruction from uni- and multivariate time series is presented. The entire embedding process is considered as a game, in which each move corresponds to an embedding cycle and is subject to an evaluation through an objective function. This way the embedding procedure can be modeled as a tree, in which each leaf holds a specific value of the objective function. By using a Monte Carlo ansatz, the proposed algorithm populates the tree with many leafs by computing different possible embedding paths and the final embedding is chosen as that particular path, which ends at the leaf with the lowest achieved value of the objective function. The method aims to prevent getting stuck in a local minimum of the objective function and can be used in a modular way, enabling practitioners to choose a statistic for possible delays in each embedding cycle as well as a suitable objective function themselves. The proposed method guarantees the optimization of the chosen objective function over the parameter space of the delay embedding as long as the tree is sampled sufficiently. As a proof of concept, we demonstrate the superiority of the proposed method over the classical time delay embedding methods using a variety of application examples. We compare recurrence plot-based statistics inferred from reconstructions of a Lorenz-96 system and highlight an improved forecast accuracy for map-like model data as well as for palaeoclimate isotope time series. Finally, we utilize state space reconstruction for the detection of causality and its strength between observables of a gas turbine type thermoacoustic combustor.
The appropriate selection of recurrence thresholds is a key problem in applications of recurrence quantification analysis and related methods across disciplines. Here, we discuss the distribution of pairwise distances between state vectors in the studied system’s state space reconstructed by means of time-delay embedding as the key characteristic that should guide the corresponding choice for obtaining an adequate resolution of a recurrence plot. Specifically, we present an empirical description of the distance distribution, focusing on characteristic changes of its shape with increasing embedding dimension. Our results suggest that selecting the recurrence threshold according to a fixed percentile of this distribution reduces the dependence of recurrence characteristics on the embedding dimension in comparison with other commonly used threshold selection methods. Numerical investigations on some paradigmatic model systems with time-dependent parameters support these empirical findings.
Recurrence plots (RPs) provide an intuitive tool for visualizing the (potentially multi-dimensional) trajectory of a dynamical system in state space. In case only univariate observations of the system’s overall state are available, time-delay embedding has become a standard procedure for qualitatively reconstructing the dynamics in state space. The selection of a threshold distance 𝜀
, which distinguishes close from distant pairs of (reconstructed) state vectors, is known to have a substantial impact on the recurrence plot and its quantitative characteristics, but its corresponding interplay with the embedding dimension has not yet been explicitly addressed. Here, we point out that the results of recurrence quantification analysis (RQA) and related methods are qualitatively robust under changes of the (sufficiently high) embedding dimension only if the full distribution of pairwise distances between state vectors is considered for selecting 𝜀, which is achieved by consideration of a fixed recurrence rate.