Searcharxiv⌕ Search

arXiv subjects

Jürgen Kurths

Publications and source records attributed to Jürgen Kurths.

At least 145 records · Page 8Linked to original sources

Bounding the first exit from the basin: Independence Times and Finite-Time Basin Stability

We study the stability of deterministic systems given sequences of large, jump-like perturbations. Our main result is to dervie a lower bound for the probability of the system to remain in the basin, given that perturbations are rare enough. This bound is efficient to evaluate numerically. To quantify rare enough, we define the notion of the independence time of such a system. This is the time after which a perturbed state has probably returned close to the attractor, meaning that subsequent perturbations can be considered separately. The effect of jump-like perturbations that occur at least the independence time apart is thus well described by a fixed probability to exit the basin at each jump, allowing us to obtain the bound. To determine the independence time, we introduce the concept of finite-time basin stability, which corresponds to the probability that a perturbed trajectory returns to an attractor within a given time. The independence time can then be determined as the time scale at which the finite-time basin stability reaches its asymptotic value. Besides that, finite-time basin stability is a novel probabilistic stability measure on its own, with potential broad applications in complex systems.

nlin.CD↗

Mapping and discrimination of networks in the complexity-entropy plane

Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories. However, even with the present variety of characteristics at hand it still remains a subject of current research to appropriately quantify a network's complexity and correspondingly discriminate between different types of complex networks, like infrastructure or social networks, on such a basis. Here, we explore the possibility to classify complex networks by means of a statistical complexity measure that has formerly been successfully applied to distinguish different types of chaotic and stochastic time series. It is composed of a network's averaged per-node entropic measure characterizing the network's information content and the associated Jenson-Shannon divergence as a measure of disequilibrium. We study 29 real world networks and show that networks of the same category tend to cluster in distinct areas of the resulting complexity-entropy plane. We demonstrate that within our framework, connectome networks exhibit among the highest complexity while, e.g, transportation and infrastructure networks display significantly lower values. Furthermore, we demonstrate the utility of our framework by applying it to families of random scale-free and Watts-Strogatz model networks. We then show in a second application that the proposed framework is useful to objectively construct threshold-based networks, such as functional climate networks or recurrence networks, by choosing the threshold such that the statistical network complexity is maximized.

physics.data-an↗

Large deviation induced phase switch in an inertial majority-vote model

We theoretically study noise-induced phase switch phenomena in an inertial majority-vote (IMV) model introduced in a recent paper [Phys. Rev. E 95, 042304 (2017)]. The IMV model generates a strong hysteresis behavior as the noise intensity $f$ goes forward and backward, a main characteristic of a first-order phase transition, in contrast to a second-order phase transition in the original MV model. Using the Wentzel-Kramers-Brillouin approximation for the master equation, we reduce the problem to finding the zero-energy trajectories in an effective Hamiltonian system, and the mean switching time depends exponentially on the associated action and the number of particles $N$. Within the hysteresis region, we find that the actions along the optimal forward switching path from ordered phase (OP) to disordered phase (DP) and its backward path, show distinct variation trends with $f$, and intersect at $f=f_c$ that determines the coexisting line of OP and DP. This results in a nonmonotonic dependence of the mean switching time between two symmetric OPs on $f$, with a minimum at $f_c$ for sufficiently large $N$. Finally, the theoretical results are validated by Monte Carlo simulations.

cond-mat.stat-mech↗

The Contribution of Different Electric Vehicle Control Strategies to Dynamical Grid Stability

A major challenge for power grids with a high share of renewable energy systems (RES), such as island grids, is to provide frequency stability in the face of renewable fluctuations. In this work we evaluate the ability of electric vehicles (EV) to provide distributed primary control and to eliminate frequency peaks. To do so we for the first time explicitly model the network structure and incorporate non-Gaussian, strongly intermittent fluctuations typical for RES. We show that EVs can completely eliminate frequency peaks. Using threshold randomization we further demonstrate that demand synchronization effects and battery stresses can be greatly reduced. In contrast, explicit frequency averaging has a strong destabilizing effect, suggesting that the role of delays in distributed control schemes requires further studies. Overall we find that distributed control outperforms central one. The results are robust against a further increase in renewable power production and fluctuations.

physics.soc-ph↗

Rewiring hierarchical scale-free networks: Influence on synchronizability and topology

Many real-world complex networks simultaneously exhibit topological features of scale-free behaviour and hierarchical organization. In this regard, deterministic scale-free [A.-L. Barabási \etal, Physica A, 299, 3 (2001)] and pseudofractal scale-free [S. N. Dorogovtsev \etal, Phy. Rev. E, 65, 6 (2002)] networks constitute notable models which simultaneously incorporate the aforementioned properties. The rules governing the formation of such networks are completely deterministic. However, real-world networks are presumably neither completely deterministic, nor perfectly hierarchical. Therefore, we suggest here perfectly hierarchical scale-free networks with randomly rewired edges as better representatives of practical networked systems. In particular, we preserve the scale-free degree distribution of the various deterministic networks but successively relax the hierarchical structure while rewiring them. We utilize the framework of master stability function in investigating the synchronizability of dynamical systems coupled on such rewired networks. Interestingly, this reveals that the process of rewiring is capable of significantly enhancing, as well as, deteriorating the synchronizability of the resulting networks. We investigate the influence of rewiring edges on the topological properties of the rewired networks and, in turn, their relation to the synchronizability of the respective topologies. Finally, we compare the synchronizability of deterministic scale-free and pseudofractcal scale-free networks with that of random scale-free networks (generated using the classical Barabási-Albert model of growth and preferential attachment) and find that the latter ones promote synchronizability better than their deterministic counterparts.

physics.soc-ph↗

Lévy noise-induced transitions in gene regulatory networks

Important effects of noise on a one-dimensional gene expression model involving a single gene have recently been discussed. However, few works have been devoted to the transition in two-dimensional models which include the interaction of genes. Therefore, we investigate here, a quantitative two-dimensional model (MeKS network) of gene expression dynamics describing the competence development in the B. subtilis under the influence of Lévy as well as Brownian motions, where noises can do the B. subtilis a favor in nutrient depletion. To analyze the transitions between the vegetative and the competence regions therein, two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP) from a microscopic perspective, as well as their averaged versions from a macroscopic perspective, are applied. The relative contribution factor (RCF), the ratio of non-Gaussian and Gaussian noise strengths, is adopted to implement optimal control in these transitions. Schematic representations indicate that there exists an optimum choice that makes the transition occurring at the highest probability. Additionally, we use a geometric concept, the stochastic basin of attraction, to exhibit a pictorial comprehension about the influence of the Lévy motion on the basin stability of the competence state.

q-bio.MN↗

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 \emph{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 \emph{slow} nodes of the network from the relatively \emph{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 \emph{global relaxation time} when starting all the nodes from random initial conditions. 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.

nlin.CD↗

Stability of Synchrony against Local Intermittent Fluctuations in Tree-like Power Grids

80% of all Renewable Energy Power in Germany is installed in tree-like distribution grids. Intermittent power fluctuations from such sources introduce new dynamics into the lower grid layers. At the same time, distributed resources will have to contribute to stabilize the grid against these fluctuations in the future. In this paper, we model a system of distributed resources as oscillators on a tree-like, lossy power grid and its ability to withstand desynchronization from localized intermittent renewable infeed. We find a remarkable interplay of network structure and the position of the node at which the fluctuations are fed in. An important precondition for our findings is the presence of losses in distribution grids. Then, the most network central node splits the network into branches with different influence on network stability. Troublemakers, i.e. nodes at which fluctuations are especially exciting the grid, tend to be downstream branches with high net power outflow. For low coupling strength, we also find branches of nodes vulnerable to fluctuations anywhere in the network. These network regions can be predicted at high confidence using an eigenvector based network measure taking the turbulent nature of perturbations into account. While we focus here on tree-like networks, the observed effects also appear, albeit less pronounced, for weakly meshed grids. On the other hand the observed effects disappear for lossless power grids often studied in the complex systems literature.

physics.soc-ph↗

A Network of Networks Approach to Interconnected Power Grids

We present two different approaches to model power grids as interconnected networks of networks. Both models are derived from a model for spatially embedded mono-layer networks and are generalised to handle an arbitrary number of network layers. The two approaches are distinguished by their use case. The static glue stick construction model yields a multi-layer network from a predefined layer interconnection scheme, i.e. different layers are attached with transformer edges. It is especially suited to construct multi-layer power grids with a specified number of nodes in and transformers between layers. We contrast it with a genuine growth model which we label interconnected layer growth model.

physics.soc-ph↗

Multi-node basin stability in complex dynamical networks

Dynamical entities interacting with each other on complex networks often exhibit multistability. The stability of a desired steady regime (e.g., a synchronized state) to large perturbations is critical in the operation of many real-world networked dynamical systems such as ecosystems, power grids, the human brain, etc. This necessitates the development of appropriate quantifiers of stability of multiple stable states of such systems. Motivated by the concept of basin stability (BS) (Menck et al., Nature Physics 9, 89 (2013)), we propose here the general framework of \emph{multi-node basin stability} for gauging global stability and robustness of networked dynamical systems in response to non-local perturbations simultaneously affecting multiple nodes of a system. The framework of multi-node BS provides an estimate of the critical number of nodes which when simultaneously perturbed, significantly reduces the capacity of the system to return to the desired stable state. Further, this methodology can be applied to estimate the minimum number of nodes of the network to be controlled or safeguarded from external perturbations to ensure proper operation of the system. Multi-node BS can also be utilized for probing the influence of spatially localised perturbations or targeted attacks to specific parts of a network. We demonstrate the potential of multi-node BS in assessing the stability of the synchronized state in a deterministic scale-free network of Rössler oscillators and a conceptual model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics.

nlin.CD↗

Deciphering the imprint of topology on nonlinear dynamical network stability

Coupled oscillator networks show a complex interrelations between topological characteristics of the network and the nonlinear stability of single nodes with respect to large but realistic perturbations. We extend previous results on these relations by incorporating sampling-based measures of the transient behaviour of the system, its survivability, as well as its asymptotic behaviour, its basin stability. By combining basin stability and survivability we uncover novel, previously unknown asymptotic states with solitary, desynchronized oscillators which are rotating with a frequency different from their natural one. They occur almost exclusively after perturbations at nodes with specific topological properties. More generally we confirm and significantly refine the results on the distinguished role tree-shaped appendices play for nonlinear stability. We find a topological classification scheme for nodes located in such appendices, that exactly separates them according to their stability properties, thus establishing a strong link between topology and dynamics. Hence, the results can be used for the identification of vulnerable nodes in power grids or other coupled oscillator networks. From this classification we can derive general design principles for resilient power grids. We find that striving for homogeneous network topologies facilitates a better performance in terms of nonlinear dynamical network stability. While the employed second-order Kuramoto-like model is parametrized to be representative for power grids, we expect these insights to transfer to other critical infrastructure systems or complex network dynamics appearing in various other fields.

nlin.CD↗

Hierarchical structures in Northern Hemispheric extratropical winter ocean-atmosphere interactions

In recent years extensive studies on the Earth's climate system have been carried out by means of advanced complex network statistics. The great majority of these studies, however, have been focusing on investigating correlation structures within single climatic fields directly on or parallel to the Earth's surface. Here, we develop a novel approach of node weighted coupled network measures to study correlations between ocean and atmosphere in the Northern Hemisphere extratropics and construct 18 coupled climate networks, each consisting of two subnetworks. In all cases, one subnetwork represents monthly sea-surface temperature (SST) anomalies, while the other is based on the monthly geopotential height (HGT) of isobaric surfaces at different pressure levels covering the troposphere as well as the lower stratosphere. The weighted cross-degree density proves to be consistent with the leading coupled pattern obtained from maximum covariance analysis. Network measures of higher order allow for a further analysis of the correlation structure between the two fields and consistently indicate that in the Northern Hemisphere extratropics the ocean is correlated with the atmosphere in a hierarchical fashion such that large areas of the ocean surface correlate with multiple statistically dissimilar regions in the atmosphere. Ultimately we show that, this observed hierarchy is linked to large-scale atmospheric variability patterns, such as the Pacific North American pattern, forcing the ocean on monthly time scales.

physics.ao-ph↗

Control of birhythmicity through conjugate self-feedback: Theory and experiment

Birhythmicity arises in several physical, biological and chemical systems. Although, many control schemes are proposed for various forms of multistability, only a few exist for controlling birhythmicity. In this paper we investigate the control of birhythmic oscillation by introducing a self-feedback mechanism that incorporates the variable to be controlled and its canonical conjugate. Using a detailed analytical treatment, bifurcation analysis and experimental demonstrations we establish that the proposed technique is capable of eliminating birhythmicity and generates monorhythmic oscillation. Further, the detailed parameter space study reveals that, apart from monorhythmicity, the system shows transition between birhythmicity and other dynamical forms of bistability. This study may have practical applications in controlling birhythmic behavior of several systems, in particular in biochemical and mechanical processes.

nlin.CD↗

Explosive Phase Transition in a Majority-Vote Model with Inertia

We generalize the original majority-vote model by incorporating an inertia into the microscopic dynamics of the spin flipping, where the spin-flip probability of any individual depends not only on the states of its neighbors, but also on its own state. Surprisingly, the order-disorder phase transition is changed from a usual continuous type to a discontinuous or an explosive one when the inertia is above an appropriate level. A central feature of such an explosive transition is a strong hysteresis behavior as noise intensity goes forward and backward. Within the hysteresis region, a disordered phase and two symmetric ordered phases are coexisting and transition rates between these phases are numerically calculated by a rare-event sampling method. A mean-field theory is developed to analytically reveal the property of this phase transition.

physics.soc-ph↗

Survivability of Deterministic Dynamical Systems

The notion of a part of phase space containing desired (or allowed) states of a dynamical system is important in a wide range of complex systems research. It has been called the safe operating space, the viability kernel or the sunny region. In this paper we define the notion of survivability: Given a random initial condition, what is the likelihood that the transient behaviour of a deterministic system does not leave a region of desirable states. We demonstrate the utility of this novel stability measure by considering models from climate science, neuronal networks and power grids. We also show that a semi-analytic lower bound for the survivability of linear systems allows a numerically very efficient survivability analysis in realistic models of power grids. Our numerical and semi-analytic work underlines that the type of stability measured by survivability is not captured by common asymptotic stability measures.

nlin.AO↗

Phase response curves for models of earthquake fault dynamics

We systematically study effects of external perturbations on models describing earthquake fault dynamics. The latter are based on the framework of the Burridge-Knopoff spring-block system, including the cases of a simple mono-block fault, as well as the paradigmatic complex faults made up of two identical or distinct blocks. The blocks exhibit relaxation oscillations, which are representative for the stick-slip behavior typical for earthquake dynamics. Our analysis is carried out by determining the phase response curves of first and second order. For a mono-block fault, we consider the impact of a single and two successive pulse perturbations, further demonstrating how the profile of phase response curves depends on the fault parameters. For a homogeneous two-block fault, our focus is on the scenario where each of the blocks is influenced by a single pulse, whereas for heterogeneous faults, we analyze how the response of the system depends on whether the stimulus is applied to the block having a shorter or a longer oscillation period.

physics.geo-ph↗

Tweaking Synchronisation by Link Addition

Natural and man-made networks often possess locally tree-like sub-structures. Taking such tree networks as our starting point, we show how the addition of links changes the synchronization properties of the network. We focus on two different methods of link addition. The first method adds single links that create cycles of a well-defined length. Following a topological approach we introduce cycles of varying length and analyze how this feature, as well as the position in the network, alters the synchronous behaviour. We show that in particular short cycles can lead to a maximum change of the Laplacian's eigenvalue spectrum, dictating the synchronization properties of such networks. The second method connects a certain proportion of the initially unconnected nodes. We simulate dynamical systems on these network topologies, with the nodes' local dynamics being either a discrete or continuous. Here our main result is that a certain amount of additional links, with the relative position in the network being crucial, can be beneficial to ensure stable synchronization.

nlin.CD↗

A hybrid multiscale coarse-grained method for dynamics on complex networks

Brute-force simulations for dynamics on very large networks are quite expensive. While phenomenological treatments may capture some macroscopic properties, they often ignore important microscopic details. Fortunately, one may be only interested in the property of local part and not in the whole network. Here, we propose a hybrid multiscale coarse-grained(HMCG) method which combines a fine Monte Carlo(MC) simulation on the part of nodes of interest with a more coarse Langevin dynamics on the rest part. We demonstrate the validity of our method by analyzing the equilibrium Ising model and the nonequilibrium susceptible-infected-susceptible model. It is found that HMCG not only works very well in reproducing the phase transitions and critical phenomena of the microscopic models, but also accelerates the evaluation of dynamics with significant computational savings compared to microscopic MC simulations directly for the whole networks. The proposed method is general and can be applied to a wide variety of networked systems just adopting appropriate microscopic simulation methods and coarse graining approaches.

physics.soc-ph↗