7 results

## Search Results

Now showing 1 - 7 of 7

- ItemPotentials and limits to basin stability estimation(Bristol : Institute of Physics Publishing, 2017) Schultz, P.; Menck, P.J.; Heitzig, J.; Kurths, J.Stability assessment methods for dynamical systems have recently been complemented by basin stability and derived measures, i.e. probabilistic statements whether systems remain in a basin of attraction given a distribution of perturbations. Their application requires numerical estimation via Monte Carlo sampling and integration of differential equations. Here, we analyse the applicability of basin stability to systems with basin geometries that are challenging for this numerical method, having fractal basin boundaries and riddled or intermingled basins of attraction. We find that numerical basin stability estimation is still meaningful for fractal boundaries but reaches its limits for riddled basins with holes.
- ItemStability threshold approach for complex dynamical systems(Bristol : Institute of Physics Publishing, 2016) Klinshov, V.V.; Nekorkin, V.I.; Kurths, J.
- ItemInterval stability for complex systems(Bristol : Institute of Physics Publishing, 2018) Klinshov, V.V.; Kirillov, S.; Kurths, J.; Nekorkin, V.I.Stability of dynamical systems against strong perturbations is an important problem of nonlinear dynamics relevant to many applications in various areas. Here, we develop a novel concept of interval stability, referring to the behavior of the perturbed system during a finite time interval. Based on this concept, we suggest new measures of stability, namely interval basin stability (IBS) and interval stability threshold (IST). IBS characterizes the likelihood that the perturbed system returns to the stable regime (attractor) in a given time. IST provides the minimal magnitude of the perturbation capable to disrupt the stable regime for a given interval of time. The suggested measures provide important information about the system susceptibility to external perturbations which may be useful for practical applications. Moreover, from a theoretical viewpoint the interval stability measures are shown to bridge the gap between linear and asymptotic stability. We also suggest numerical algorithms for quantification of the interval stability characteristics and demonstrate their potential for several dynamical systems of various nature, such as power grids and neural networks.
- ItemTiming of transients: Quantifying reaching times and transient behavior in complex systems(Bristol : Institute of Physics Publishing, 2017) Kittel, T.; Heitzig, J.; Webster, K.; Kurths, J.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.
- ItemA reconfigurable logic cell based on a simple dynamical system(New York, NY : Hindawi Publishing Corporation, 2013) Li, L.; Yang, C.; Hui, S.; Yu, W.; Kurths, J.; Peng, H.; Yang, Y.This paper introduces a new scheme to achieve a dynamic logic gate which can be adjusted flexibly to obtain different logic functions by adjusting specific parameters of a dynamical system. Based on graphical tools and the threshold mechanism, the distribution of different logic gates is studied, and a transformation method between different logics is given. Analyzing the performance of the dynamical system in the presence of noise, we discover that it is resistant to system noise. Moreover, we find some part of the system can be considered as a leaky integrator which has been already widely applied in engineering. Finally, we provide a proof-of-principle hardware implementation of the proposed scheme to illustrate its effectiveness. With the proposed scheme in hand, it is convenient to build the flexible, robust, and general purpose computing devices such as various network coding routers, communication encoders or decoders, and reconfigurable computer chips.
- ItemRecovery time after localized perturbations in complex dynamical networks(Bristol : Institute of Physics Publishing, 2017) Mitra, C.; Kittel, T.; Choudhary, A.; Kurths, J.; Donner, R.V.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.
- ItemRecurrence networks-a novel paradigm for nonlinear time series analysis(College Park, MD : Institute of Physics Publishing, 2010) Donner, R.V.; Zou, Y.; Donges, J.F.; Marwan, N.; Kurths, J.This paper presents a new approach for analysing the structural properties of time series from complex systems. Starting from the concept of recurrences in phase space, the recurrence matrix of a time series is interpreted as the adjacency matrix of an associated complex network, which links different points in time if the considered states are closely neighboured in phase space. In comparison with similar network-based techniques the new approach has important conceptual advantages, and can be considered as a unifying framework for transforming time series into complex networks that also includes other existing methods as special cases. It has been demonstrated here that there are fundamental relationships between many topological properties of recurrence networks and different nontrivial statistical properties of the phase space density of the underlying dynamical system. Hence, this novel interpretation of the recurrence matrix yields new quantitative characteristics (such as average path length, clustering coefficient, or centrality measures of the recurrence network) related to the dynamical complexity of a time series, most of which are not yet provided by other existing methods of nonlinear time series analysis. Â© IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.