Search Results
Master Memory Function for Delay-Based Reservoir Computers With Single-Variable Dynamics
We show that many delay-based reservoir computers considered in the literature can be characterized by a universal master memory function (MMF). Once computed for two independent parameters, this function provides linear memory capacity for any delay-based single-variable reservoir with small inputs. Moreover, we propose an analytical description of the MMF that enables its efficient and fast computation. Our approach can be applied not only to single-variable delay-based reservoirs governed by known dynamical rules, such as the Mackey–Glass or Stuart–Landau-like systems, but also to reservoirs whose dynamical model is not available.
Recovery time after localized perturbations in complex dynamical networks
Maintaining the synchronous motion of dynamical systems interacting on complex networks is often critical to their functionality. However, real-world networked dynamical systems operating synchronously are prone to random perturbations driving the system to arbitrary states within the corresponding basin of attraction, thereby leading to epochs of desynchronized dynamics with a priori unknown durations. Thus, it is highly relevant to have an estimate of the duration of such transient phases before the system returns to synchrony, following a random perturbation to the dynamical state of any particular node of the network. We address this issue here by proposing the framework of single-node recovery time (SNRT) which provides an estimate of the relative time scales underlying the transient dynamics of the nodes of a network during its restoration to synchrony. We utilize this in differentiating the particularly slow nodes of the network from the relatively fast nodes, thus identifying the critical nodes which when perturbed lead to significantly enlarged recovery time of the system before resuming synchronized operation. Further, we reveal explicit relationships between the SNRT values of a network, and its global relaxation time when starting all the nodes from random initial conditions. Earlier work on relaxation time generally focused on investigating its dependence on macroscopic topological properties of the respective network. However, we employ the proposed concept for deducing microscopic relationships between topological features of nodes and their respective SNRT values. The framework of SNRT is further extended to a measure of resilience of the different nodes of a networked dynamical system. We demonstrate the potential of SNRT in networks of Rössler oscillators on paradigmatic topologies and a model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics illustrating the conceivable practical applicability of the proposed concept.
Neural partial differential equations for chaotic systems
When predicting complex systems one typically relies on differential equation which can often be incomplete, missing unknown influences or higher order effects. By augmenting the equations with artificial neural networks we can compensate these deficiencies. We show that this can be used to predict paradigmatic, high-dimensional chaotic partial differential equations even when only short and incomplete datasets are available. The forecast horizon for these high dimensional systems is about an order of magnitude larger than the length of the training data.
Timing of transients: Quantifying reaching times and transient behavior in complex systems
In dynamical systems, one may ask how long it takes for a trajectory to reach the attractor, i.e. how long it spends in the transient phase. Although for a single trajectory the mathematically precise answer may be infinity, it still makes sense to compare different trajectories and quantify which of them approaches the attractor earlier. In this article, we categorize several problems of quantifying such transient times. To treat them, we propose two metrics, area under distance curve and regularized reaching time, that capture two complementary aspects of transient dynamics. The first, area under distance curve, is the distance of the trajectory to the attractor integrated over time. It measures which trajectories are 'reluctant', i.e. stay distant from the attractor for long, or 'eager' to approach it right away. Regularized reaching time, on the other hand, quantifies the additional time (positive or negative) that a trajectory starting at a chosen initial condition needs to approach the attractor as compared to some reference trajectory. A positive or negative value means that it approaches the attractor by this much 'earlier' or 'later' than the reference, respectively. We demonstrated their substantial potential for application with multiple paradigmatic examples uncovering new features.
Nonlinear dynamical properties of frequency swept fiber-based semiconductor lasers
We investigate dynamics of semiconductor lasers with fiber-based unidirectional ring cavity that can be used as frequency swept sources. We identify key factors behind the reach dynamical behaviour of such lasers using state-of-the-art experimental and analytical methods. Experimentally, we study the laser in static, quasi-static and synchronisation regimes.We apply experimental methods such as optical heterodyne or electric field reconstruction in order to characterise these regimes or study the mechanisms of transition between them. Using a delay differential equation model, we demonstrate that the presence of chromatic dispersion can lead to destabilisation of the laser modes through modulational instability, which results in undesirable chaotic emission. We characterise the instability threshold both theoretically and experimentally, and demonstrate deterioration of the FDML regime near the threshold.