Delay embedding methods are a staple tool in the field of time series analysis and prediction. However, the selection of embedding parameters can have a big impact on the resulting analysis. This has led to the creation of a large number of methods to optimize the selection of parameters such as embedding lag. This paper aims to provide a comprehensive overview of the fundamentals of embedding theory for readers who are new to the subject. We outline a collection of existing methods for selecting embedding lag in both uniform and non-uniform delay embedding cases. Highlighting the poor dynamical explainability of existing methods of selecting non-uniform lags, we provide an alternative method of selecting embedding lags that includes a mixture of both dynamical and topological arguments. The proposed method, Significant Times on Persistent Strands (SToPS), uses persistent homology to construct a characteristic time spectrum that quantifies the relative dynamical significance of each time lag. We test our method on periodic, chaotic, and fast-slow time series and find that our method performs similar to existing automated non-uniform embedding methods. Additionally, -step predictors trained on embeddings constructed with SToPS were found to outperform other embedding methods when predicting fast-slow time series.
1 March 2022 in Chaos: An Interdisciplinary Journal of Nonlinear Science
We present the idea of reservoir time series analysis (RTSA), a method by which the state space representation generated by a reservoir computing (RC) model can be used for time series analysis. We discuss the motivation for this with reference to the characteristics of RC and present three ad hoc methods for generating representative features from the reservoir state space. We then develop and implement a hypothesis test to assess the capacity of these features to distinguish signals from systems with varying parameters. In comparison to a number of benchmark approaches (statistical, Fourier, phase space, and recurrence analysis), we are able to show significant, generalized accuracy across the proposed RTSA features that surpasses the benchmark methods. Finally, we briefly present an application for bearing fault distinction to motivate the use of RTSA in application.
1 August 2018 in Chaos: An Interdisciplinary Journal of Nonlinear Science
It is rarely possible to precisely characterise the system underlying a series of observations. Hypothesis testing, which involves assessing simple assumptions about driving mechanisms, provides hope that we can at least rule out certain possibilities regarding the nature of the system. Unfortunately, the brevity, nonstationarity, and symbolic nature of certain time series of interest undermines traditional hypothesis tests. Fortunately, recurrence quantification analysis (RQA) has an established record of success in understanding short and nonstationary time series. We evaluate the suitability of measures of RQA as test statistics in surrogate data tests of the hypothesis that ten compositions by the Baroque composer J. S. Bach (1685–1750) arose from a Markov chain. More specifically, we estimate the size (the rate at which true hypotheses are incorrectly rejected) and power (the rate at which false hypotheses are correctly rejected) from empirical rejection rates across 1000 realisations, for each of the ten compositions, of the surrogate algorithm. We compare hypothesis tests based on RQA measures to tests based on the conditional entropy, an established test statistic for surrogate data tests of Markov order, and find that the RQA measure provides more consistent rejection of the fairly implausible hypothesis that Bach’s brain was a Markov chain.
7 August 2023 in IEEE Transactions on Network Science and Engineering
Dynamical networks are versatile models that describe a variety of behaviours such as synchronisation and feedback in networks of coupled dynamical components. However, applying these models in real systems is difficult as prior information of the connectivity structure or local dynamics is often unknown and must be inferred from node state observations. Additionally, the influence of coupling interactions complicates the isolation of local node dynamics. Given the architectural similarities between dynamical networks and recurrent neural networks (RNNs), we propose a network inference method based on the backpropagation through time (BPTT) algorithm used to train RNNs. This method aims to simultaneously infer both the connectivity structure and isolated local node dynamics from node state observations. An approximation of local node dynamics is first constructed using a neural network. This is alternated with an adapted BPTT algorithm to regress corresponding network weights by minimising prediction errors of the network based on the previously constructed local models until convergence. This method was successful in identifying the connectivity structure for coupled networks of chaotic oscillators. Freerun prediction performance with the resulting local models and weights was comparable to the true system with noisy initial conditions. The method is also extended to asymmetric negative coupling.
1 December 2021 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Assessing model accuracy for complex and chaotic systems is a non-trivial task that often relies on the calculation of dynamical invariants, such as Lyapunov exponents and correlation dimensions. Well-performing models are able to replicate the long-term dynamics and ergodic properties of the desired system. We term this phenomenon “dynamics learning.” However, existing estimates based on dynamical invariants, such as Lyapunov exponents and correlation dimensions, are not unique to each system, not necessarily robust to noise, and struggle with detecting pathological errors, such as errors in the manifold density distribution. This can make meaningful and accurate model assessment difficult. We explore the use of a topological data analysis technique, persistent homology, applied to uniformly sampled trajectories from constructed reservoir models of the Lorenz system to assess the learning quality of a model. A proposed persistent homology point summary, conformance, was able to identify models with successful dynamics learning and detect discrepancies in the manifold density distribution.
4 February 2022 in Medical & Biological Engineering & Computing