Synchronization invariance under network structural transformations

Functional control of oscillator networks

Oscillatory activity is ubiquitous in natural and engineered network systems. The interaction scheme underlying interdependent oscillatory components governs the emergence of network-wide patterns of synchrony that regulate and enable complex functions. Yet, understanding, and ultimately harnessing, the structure-function relationship in oscillator networks remains an outstanding challenge of modern science. Here, we address this challenge by presenting a principled method to prescribe exact and robust functional configurations from local network interactions through optimal tuning of the oscillators’ parameters. To quantify the behavioral synchrony between coupled oscillators, we introduce the notion of functional pattern, which encodes the pairwise relationships between the oscillators’ phases. Our procedure is computationally efficient and provably correct, accounts for constrained interaction types, and allows to concurrently assign multiple desired functional patterns. Further, we derive algebraic and graph-theoretic conditions to guarantee the feasibility and stability of target functional patterns. These conditions provide an interpretable mapping between the structural constraints and their functional implications in oscillator networks. As a proof of concept, we apply the proposed method to replicate empirically recorded functional relationships from cortical oscillations in a human brain, and to redistribute the active power flow in different models of electrical grids.

In network systems governed by oscillatory activity, such as brain networks or power grids, configurations of synchrony may define network functions. The authors introduce a control approach for the formation of desired synchrony patterns through optimal interventions on the network parameters.

Optimizing synchrony with a minimal coupling strength of coupled phase oscillators on complex networks based on desynchronous clustering

Finding the globally optimal network is an unsolved problem in synchrony optimization. In this paper, an efficient edge-adding optimization method based on global information is proposed. The edge-adding scheme is obtained through the eigenvector corresponding to the maximum eigenvalue of the system's Jacobian matrix. With different frequency distributions, we find that the optimized networks have similar features, concluded as three conditions: (i) The deviations of nodes' frequencies from the mean value are linear with the nodes' degrees, (ii) the oscillators form a bipartite network divided according to the frequencies of the oscillators, and (iii) oscillators are only connected to those with sufficiently large frequency differences. An optimal network can be constructed directly based on these three conditions for a given distribution of natural frequencies. We show that the critical coupling strengths of these constructed networks approach the theoretical lower bound. The constructed networks are or at least close to the globally optimal ones for synchrony.

Geometric unfolding of synchronization dynamics on networks

We study the synchronized state in a population of network-coupled, heterogeneous oscillators. In particular, we show that the steady-state solution of the linearized dynamics may be written as a geometric series whose subsequent terms represent different spatial scales of the network. Specifically, each additional term incorporates contributions from wider network neighborhoods. We prove that this geometric expansion converges for arbitrary frequency distributions and for both undirected and directed networks provided that the adjacency matrix is primitive. We also show that the error in the truncated series grows geometrically with the second largest eigenvalue of the normalized adjacency matrix, analogously to the rate of convergence to the stationary distribution of a random walk. Last, we derive a local approximation for the synchronized state by truncating the spatial series, at the first neighborhood term, to illustrate the practical advantages of our approach.

Uncertainty propagation in complex networks: From noisy links to critical properties

Many complex networks are built up from empirical data prone to experimental error. Thus, the determination of the specific weights of the links is a noisy measure. Noise propagates to those macroscopic variables researchers are interested in, such as the critical threshold for synchronization of coupled oscillators or for the spreading of a disease. Here, we apply error propagation to estimate the macroscopic uncertainty in the critical threshold for some dynamical processes in networks with noisy links. We obtain closed form expressions for the mean and standard deviation of the critical threshold depending on the properties of the noise and the moments of the degree distribution of the network. The analysis provides confidence intervals for critical predictions when dealing with uncertain measurements or intrinsic fluctuations in empirical networked systems. Furthermore, our results unveil a nonmonotonous behavior of the uncertainty of the critical threshold that depends on the specific network structure.

Enhancing network synchronizability by strengthening a single node

In improving the stability of complex dynamical systems, an outstanding problem is how to achieve the desired performance at a low cost. For engineering and biological complex systems whose performance and functionality rely on the synchronous motion of their units, an important question related to the performance-cost-balance problem is how to improve efficiently the system synchronizability when a small amount of additional coupling resource is available. Here, employing a complex network of coupled chaotic oscillators as the model, we address this question by introducing a small amount of coupling intensity to only a single oscillator and investigate how the improvement of the network synchronizability is dependent on the location of the target oscillator. Theoretical analysis shows that, to achieve the maximum network synchronizability, the target oscillator to be strengthened should be chosen according to the eigenvector of the most unstable mode. Based on the theoretical finding, we further propose a single-node-based scheme for improving synchronization: the eigenvector-centrality-based strengthening scheme. We describe in detail how to apply this scheme under different synchronization scenarios and justify its efficiency in various network models by numerical simulations. The performance of the new scheme is compared with the conventional ones based on betweenness, closeness, and degree centralities, and it is shown that the new scheme has a clear advantage over the conventional ones. Furthermore, by a brute-force search of the target oscillator over the network, it is verified numerically that the oscillator identified by the new scheme indeed gives the best synchronization performance.

Pattern invariance for reaction-diffusion systems on complex networks

Given a reaction-diffusion system interacting via a complex network, we propose two different techniques to modify the network topology while preserving its dynamical behaviour. In the region of parameters where the homogeneous solution gets spontaneously destabilized, perturbations grow along the unstable directions made available across the networks of connections, yielding irregular spatio-temporal patterns. We exploit the spectral properties of the Laplacian operator associated to the graph in order to modify its topology, while preserving the unstable manifold of the underlying equilibrium. The new network is isodynamic to the former, meaning that it reproduces the dynamical response (pattern) to a perturbation, as displayed by the original system. The first method acts directly on the eigenmodes, thus resulting in a general redistribution of link weights which, in some cases, can completely change the structure of the original network. The second method uses localization properties of the eigenvectors to identify and randomize a subnetwork that is mostly embedded only into the stable manifold. We test both techniques on different network topologies using the Ginzburg-Landau system as a reference model. Whereas the correlation between patterns on isodynamic networks generated via the first recipe is larger, the second method allows for a finer control at the level of single nodes. This work opens up a new perspective on the multiple possibilities for identifying the family of discrete supports that instigate equivalent dynamical responses on a multispecies reaction-diffusion system.