arXiv subjects

Jürgen Kurths

Publications and source records attributed to Jürgen Kurths.

At least 163 records · Page 9Linked to original sources

arXiv2016

Synchronization in Delayed Multiplex Networks

We study impact of multiplexing on the global phase synchronizability of different layers in the delayed coupled multiplex networks. We find that at strong couplings, the multiplexing induces the global synchronization in sparse networks. The introduction of global synchrony depends on the connection density of the layers being multiplexed, which further depends on the underlying network architecture. Moreover, multiplexing may lead to a transition from a quasi-periodic or chaotic evolution to a periodic evolution. For the periodic case, the multiplexing may lead to a change in the period of the dynamical evolution. Additionally, delay in the couplings may bring upon synchrony to those multiplex networks which do not exhibit synchronization for the undelayed evolution. Using a simple example of two globally connected layers forming a multiplex network, we show how delay brings upon a possibility for the inter layer global synchrony, that is not possible for the undelayed evolution.

nlin.CD↗

arXiv2016

Traveling phase waves in asymmetric networks of noisy chaotic attractors

We explore identical Rössler systems organized into two equally-sized groups, among which differing positive and negative in- and out-coupling strengths are allowed. Patterns of distinctly synchronized phase dynamics are observed, which coexist with chaotically evolving amplitudes. In particular, we report the emergence of traveling phase waves, i.e. states in which the oscillators settle on a new rhythm different from their own. We further elucidate our findings through phase-coupled Rössler systems, establishing a connection with the Kuramoto model. Together with the study of noise effects, our results suggest a promising new avenue towards the coexistence of chaotic, noisy and regular collective dynamics.

nlin.CD↗

arXiv2016

Correlation networks from flows. The case of forced and time-dependent advection-diffusion dynamics

Complex network theory provides an elegant and powerful framework to statistically investigate different types of systems such as society, brain or the structure of local and long-range dynamical interrelationships in the climate system. Network links in climate networks typically imply information, mass or energy exchange. However, the specific connection between oceanic or atmospheric flows and the climate network's structure is still unclear. We propose a theoretical approach for verifying relations between the correlation matrix and the climate network measures, generalizing previous studies and overcoming the restriction to stationary flows. Our methods are developed for correlations of a scalar quantity (temperature, for example) which satisfies an advection-diffusion dynamics in the presence of forcing and dissipation. Our approach reveals that correlation networks are not sensitive to steady sources and sinks and the profound impact of the signal decay rate on the network topology. We illustrate our results with calculations of degree and clustering for a meandering flow resembling a geophysical ocean jet.

physics.flu-dyn↗

arXiv2016

A climate network-based index to discriminate different types of El Niño and La Niña

El Niño exhibits distinct Eastern Pacific (EP) and Central Pacific (CP) types which are commonly, but not always consistently, distinguished from each other by different signatures in equatorial climate variability. Here, we propose an index based on evolving climate networks to objectively discriminate between both flavors by utilizing a scalar-valued evolving climate network measure that quantifies spatial localization and dispersion in El Niño's associated teleconnections. Our index displays a sharp peak (high localization) during EP events, whereas during CP events (larger dispersion) it remains close to the baseline observed during normal periods. In contrast to previous classification schemes, our approach specifically account for El Niño's global impacts. We confirm recent El Niño classifications for the years 1951 to 2014 and assign types to those cases were former works yielded ambiguous results. Ultimately, we study La Niña episodes and demonstrate that our index provides a similar discrimination into two types.

physics.data-an↗

arXiv2016

Edge anisotropy and the geometric perspective on flow networks

Spatial networks have recently attracted great interest in various fields of research. While the traditional network-theoretic viewpoint is commonly restricted to their topological characteristics (often disregarding existing spatial constraints), this work takes a geometric perspective, which considers vertices and edges as objects in a metric space and quantifies the corresponding spatial distribution and alignment. For this purpose, we introduce the concept of edge anisotropy and define a class of measures characterizing the spatial directedness of connections. Specifically, we demonstrate that the local anisotropy of edges incident to a given vertex provides useful information about the local geometry of geophysical flows based on networks constructed from spatio-temporal data, which is complementary to topological characteristics of the same flow networks. Taken both structural and geometric viewpoints together can thus assist the identification of underlying flow structures from observations of scalar variables.

physics.flu-dyn↗

arXiv2016

How complex climate networks complement eigen techniques for the statistical analysis of climatological data

Eigen techniques such as empirical orthogonal function (EOF) or coupled pattern (CP) / maximum covariance analysis have been frequently used for detecting patterns in multivariate climatological data sets. Recently, statistical methods originating from the theory of complex networks have been employed for the very same purpose of spatio-temporal analysis. This climate network (CN) analysis is usually based on the same set of similarity matrices as is used in classical EOF or CP analysis, e.g., the correlation matrix of a single climatological field or the cross-correlation matrix between two distinct climatological fields. In this study, formal relationships as well as conceptual differences between both eigen and network approaches are derived and illustrated using exemplary global precipitation, evaporation and surface air temperature data sets. These results allow to pinpoint that CN analysis can complement classical eigen techniques and provides additional information on the higher-order structure of statistical interrelationships in climatological data. Hence, CNs are a valuable supplement to the statistical toolbox of the climatologist, particularly for making sense out of very large data sets such as those generated by satellite observations and climate model intercomparison exercises.

physics.data-an↗

arXiv2016

Macroscopic description of complex adaptive networks co-evolving with dynamic node states

In many real-world complex systems, the time-evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here, we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the co-evolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we show that in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability play a crucial role for the sustainability of the system's equilibrium state. We derive a macroscopic description of the system which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network and is applicable to many fields of study, such as epidemic spreading or social modeling.

physics.soc-ph↗

arXiv2016

Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes

Networks with nodes embedded in a metric space have gained increasing interest in recent years. The effects of spatial embedding on the networks' structural characteristics, however, are rarely taken into account when studying their macroscopic properties. Here, we propose a hierarchy of null models to generate random surrogates from a given spatially embedded network that can preserve global and local statistics associated with the nodes' embedding in a metric space. Comparing the original network's and the resulting surrogates' global characteristics allows to quantify to what extent these characteristics are already predetermined by the spatial embedding of the nodes and links. We apply our framework to various real-world spatial networks and show that the proposed models capture macroscopic properties of the networks under study much better than standard random network models that do not account for the nodes' spatial embedding. Depending on the actual performance of the proposed null models, the networks are categorized into different classes. Since many real-world complex networks are in fact spatial networks, the proposed approach is relevant for disentangling underlying complex system structure from spatial embedding of nodes in many fields, ranging from social systems over infrastructure and neurophysiology to climatology.

physics.soc-ph↗

arXiv2016

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

We introduce the \texttt{pyunicorn} (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. \texttt{pyunicorn} is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics or network surrogates. Additionally, \texttt{pyunicorn} provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis (RQA), recurrence networks, visibility graphs and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology.

physics.data-an↗

arXiv2016

Deep Graphs - a general framework to represent and analyze heterogeneous complex systems across scales

Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. In recent years great progress has been made by augmenting `traditional' network theory. However, existing network representations still lack crucial features in order to serve as a general data analysis tool. These include, most importantly, an explicit association of information with possibly heterogeneous types of objects and relations, and a conclusive representation of the properties of groups of nodes as well as the interactions between such groups on different scales. In this paper, we introduce a collection of definitions resulting in a framework that, on the one hand, entails and unifies existing network representations (e.g., network of networks, multilayer networks), and on the other hand, generalizes and extends them by incorporating the above features. To implement these features, we first specify the nodes and edges of a finite graph as sets of properties. Second, the mathematical concept of partition lattices is transferred to network theory in order to demonstrate how partitioning the node and edge set of a graph into supernodes and superedges allows to aggregate, compute and allocate information on and between arbitrary groups of nodes. The derived partition lattice of a graph, which we denote by deep graph, constitutes a concise, yet comprehensive representation that enables the expression and analysis of heterogeneous properties, relations and interactions on all scales of a complex system in a self-contained manner. Furthermore, to be able to utilize existing network-based methods and models, we derive different representations of multilayer networks from our framework and demonstrate the advantages of our representation. We exemplify an application of deep graphs using a real world dataset of precipitation measurements.

physics.data-an↗

arXiv2016

Disentangling regular and chaotic motion in the standard map using complex network analysis of recurrences in phase space

Recurrence in the phase space of complex systems is a well-studied phenomenon, which has provided deep insights into the nonlinear dynamics of such systems. For dissipative systems, characteristics based on recurrence plots have recently attracted much interest for discriminating qualitatively different types of dynamics in terms of measures of complexity, dynamical invariants, or even structural characteristics of the underlying attractor's geometry in phase space. Here, we demonstrate that the latter approach also provides a corresponding distinction between different co-existing dynamical regimes of the standard map, a paradigmatic example of a low-dimensional conservative system. Specifically, we show that the recently developed approach of recurrence network analysis provides potentially useful geometric characteristics distinguishing between regular and chaotic orbits. We find that chaotic orbits in an intermittent laminar phase (commonly referred to as sticky orbits) have a distinct geometric structure possibly differing in a subtle way from those of regular orbits, which is highlighted by different recurrence network properties obtained from relatively short time series. Thus, this approach can help discriminating regular orbits from laminar phases of chaotic ones, which presents a persistent challenge to many existing chaos detection techniques.

nlin.CD↗

arXiv2016

Constrained basin stability for studying transient phenomena in dynamical systems

Transient dynamics are of large interest in many areas of science. Here, a generalization of basin stability (BS) is presented: constrained basin stability (CBS) that is sensitive to various different types of transients arising from finite size perturbations. CBS is applied to the paradigmatic Lorenz system for uncovering nonlinear precursory phenomena of a boundary crisis bifurcation. Further, CBS is used in a model of the Earth's carbon cycle as a return time-dependent stability measure of the system's global attractor. Both case studies illustrate how CBS's sensitivity to transients complements BS in its function as an early warning signal and as a stability measure. CBS is broadly applicable in systems where transients matter, from physics and engineering to sustainability science. Thus, CBS complements stability analysis with BS as well as classical linear stability analysis and will be a useful tool for many applications.

nlin.CD↗

arXiv2016

Potentials and Limits to Basin Stability Estimation

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. This requires numerical estimation via Monte-Carlo sampling and integration of differential equations. Here, we analyze the applicability of basin stability to systems with basin geometries 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.

nlin.CD↗

arXiv2016

Evaluation of selected recurrence measures in discriminating pre-ictal and inter-ictal periods from epileptic EEG data

We investigate the suitability of selected measures of complexity based on recurrence quantification analysis and recurrence networks for an identification of pre-seizure states in multi-day, multi-channel, invasive electroencephalographic recordings from five epilepsy patients. We employ several statistical techniques to avoid spurious findings due to various influencing factors and due to multiple comparisons and observe precursory structures in three patients. Our findings indicate a high congruence among measures in identifying seizure precursors and emphasize the current notion of seizure generation in large-scale epileptic networks. A final judgment of the suitability for field studies, however, requires evaluation on a larger database.

nlin.CD↗

arXiv2016

A Random Growth Model for Power Grids and Other Spatially Embedded Infrastructure Networks

We propose a model to create synthetic networks that may also serve as a narrative of a certain kind of infrastructure network evolution. It consists of an initialization phase with the network extending tree-like for minimum cost and a growth phase with an attachment rule giving a trade-off between cost-optimization and redundancy. Furthermore, we implement the feature of some lines being split during the grid's evolution. We show that the resulting degree distribution has an exponential tail and may show a maximum at degree two, suitable to observations of real-world power grid networks. In particular, the mean degree and the slope of the exponential decay can be controlled in partial independence. To verify to which extent the degree distribution is described by our analytic form, we conduct statistical tests, showing that the hypothesis of an exponential tail is well-accepted for our model data.

physics.soc-ph↗

arXiv2016

Suppression of neuronal phase synchronisation in cat cerebral cortex

We have studied effects of perturbations on the cat cerebral cortex. According to the literature, this cortex structure can be described by a clustered network. This way, we construct a clustered network with the same number of areas as in the cat matrix, where each area is described as a sub-network with small-world property. We focus on the suppression of neuronal phase synchronisation considering different kinds of perturbations. Among the various controlling interventions, we choose three methods: delayed feedback control, external time-periodic driving, and activation of selected neurons. We simulate these interventions to provide a procedure to suppress undesired and pathological abnormal rhythms that can be associated with many forms of synchronisation. In our simulations, we have verified that the efficiency of synchronisation suppression by delayed feedback control is higher than external time-periodic driving and activation of selected neurons for the cat cerebral cortex with the same coupling strengths.

q-bio.NC↗

arXiv2015

Stability threshold approach for complex dynamical systems

A new measure to characterize stability of complex dynamical systems against large perturbation is suggested, the stability threshold (ST). It quantifies the magnitude of the weakest perturbation capable to disrupt the system and switch it to an undesired dynamical regime. In the phase space, the stability threshold corresponds to the "thinnest site" of the attraction basin and therefore indicates the most "dangerous" direction of perturbations. We introduce a computational algorithm for quantification of the stability threshold and demonstrate that the suggested approach is effective and provides important insights. The generality of the obtained results defines their vast potential for application in such fields as engineering, neuroscience, power grids, Earth science and many others where robustness of complex systems is studied.

nlin.CD↗

arXiv2015

The Kuramoto model in complex networks

Synchronization of an ensemble of oscillators is an emergent phenomenon present in several complex systems, ranging from social and physical to biological and technological systems. The most successful approach to describe how coherent behavior emerges in these complex systems is given by the paradigmatic Kuramoto model. This model has been traditionally studied in complete graphs. However, besides being intrinsically dynamical, complex systems present very heterogeneous structure, which can be represented as complex networks. This report is dedicated to review main contributions in the field of synchronization in networks of Kuramoto oscillators. In particular, we provide an overview of the impact of network patterns on the local and global dynamics of coupled phase oscillators. We cover many relevant topics, which encompass a description of the most used analytical approaches and the analysis of several numerical results. Furthermore, we discuss recent developments on variations of the Kuramoto model in networks, including the presence of noise and inertia. The rich potential for applications is discussed for special fields in engineering, neuroscience, physics and Earth science. Finally, we conclude by discussing problems that remain open after the last decade of intensive research on the Kuramoto model and point out some promising directions for future research.

nlin.AO↗