Enhancing synchronizability of diffusively coupled dynamical networks: a survey

Fiedler value: The cumulated dynamical contribution value of all edges in a complex network

Fiedler value, as the minimal real part of (or the minimal) nonzero Laplacian eigenvalue, garners significant attention as a metric for evaluating network topology and its dynamics. In this paper, we address the quantification relation between Fiedler value and each edge in a directed complex network, considering undirected networks as a special case. We propose an approach to measure the dynamical contribution value of each edge. Interestingly, these contribution values can be both positive and negative, which are determined by the left and right Fiedler vectors. Further, we show that the cumulated dynamical contribution value of all edges is exactly the Fiedler value. This provides a promising angle on the Fiedler value in terms of dynamics and network structure. Therefore, the percentage of contribution of each edge to the Fiedler value is quantified. Numerical results reveal that network dynamics is significantly influenced by a small fraction of edges, say, one single directed edge contributes to over 90% of the Fiedler value in the Cat Cerebral Cortex network.

Rapid changes in synchronizability in conductance-based neuronal networks with conductance-based coupling

Real neurons connect to each other non-randomly. These connectivity graphs can potentially impact the ability of networks to synchronize, along with the dynamics of neurons and the dynamics of their connections. How the connectivity of networks of conductance-based neuron models like the classical Hodgkin-Huxley model or the Morris-Lecar model impacts synchronizability remains unknown. One powerful tool to resolve the synchronizability of these networks is the master stability function (MSF). Here, we apply and extend the MSF approach to networks of Morris-Lecar neurons with conductance-based coupling to determine under which parameters and for which graphs the synchronous solutions are stable. We consider connectivity graphs with a constant non-zero row sum, where the MSF approach can be readily extended to conductance-based synapses rather than the more well-studied diffusive connectivity case, which primarily applies to gap junction connectivity. In this formulation, the synchronous solution is a single, self-coupled, or "autaptic" neuron. We find that the primary determining parameter for the stability of the synchronous solution is, unsurprisingly, the reversal potential, as it largely dictates the excitatory/inhibitory potential of a synaptic connection. However, the change between "excitatory" and "inhibitory" synapses is rapid, with only a few millivolts separating stability and instability of the synchronous state for most graphs. We also find that for specific coupling strengths (as measured by the global synaptic conductance), islands of synchronizability in the MSF can emerge for inhibitory connectivity. We verified the stability of these islands by direct simulation of pairs of neurons coupled with eigenvalues in the matching spectrum.

Maximizing synchronizability of networks with community structure based on node similarity

In reality, numerous networks have a community structure characterized by dense intra-community connections and sparse inter-community connections. In this article, strategies are proposed to enhance synchronizability of such networks by rewiring a certain number of inter-community links, where the research scope is complete synchronization on undirected and diffusively coupled dynamic networks. First, we explore the effect of adding links between unconnected nodes with different similarity levels on network synchronizability and find that preferentially adding links between nodes with lower similarity can improve network synchronizability more than that with higher similarity, where node similarity is measured by our improved Asymmetric Katz (AKatz) and Asymmetric Leicht-Holme-Newman (ALHNII) methods from the perspective of link prediction. Additional simulations demonstrate that the node similarity-based link-addition strategy is more effective in enhancing network synchronizability than the node centrality-based methods. Furthermore, we apply the node similarity-based link-addition or deletion strategy as the valid criteria to the rewiring process of inter-community links and then propose a Node Similarity-Based Rewiring Optimization (NSBRO) algorithm, where the optimization process is realized by a modified simulated annealing technique. Simulations show that our proposed method performs better in optimizing synchronization of such networks compared with other centrality-based heuristic methods. Finally, simulations on the Rössler system indicate that the network structure optimized by the NSBRO algorithm also leads to better synchronizability of coupled oscillators.

The essential synchronization backbone problem

Network optimization strategies for the process of synchronization have generally focused on the re-wiring or re-weighting of links in order to (1) expand the range of coupling strengths that achieve synchronization, (2) expand the basin of attraction for the synchronization manifold, or (3) lower the average time to synchronization. A new optimization goal is proposed in seeking the minimum subset of the edge set of the original network that enables the same essential ability to synchronize in that the synchronization manifolds have conjugate stability. We call this type of minimal spanning subgraph an essential synchronization backbone of the original system, and we present two algorithms: one is a strategy for an exhaustive search for a true solution, while the other is a method of approximation for this combinatorial problem. The solution spaces that result from different choices of dynamical systems and coupling schemes vary with the level of a hierarchical structure present and also the number of interwoven central cycles. Applications can include the important problem in civil engineering of power grid hardening, where new link creation may be costly, and the defense of certain key links to the functional process may be prioritized.

Nodes with the highest control power play an important role at the final level of cooperation in directed networks

Controllability of complex networks aims to seek the lowest number of nodes (the driver nodes) that can control all the nodes by receiving the input signals. The concept of control centrality is used to determine the power of each node to control the network. The more a node controls the nodes through connections in the network, the more it has the power to control. Although the cooperative and free-rider strategies and the final level of cooperation in a population are considered and studied in the public goods game. However, it is yet to determine a solution to indicate the effectiveness of each member in changing the strategies of the other members. In a network, the choice of nodes effective in changing the other nodes' strategies, as free-riders, will lead to lower cooperation and vice versa. This paper uses simulated and real networks to investigate that the nodes with the highest control power are more effective than the hubs, local, and random nodes in changing the strategies of the other nodes and the final level of cooperation. Results indicate that the nodes with the highest control power as free-riders, compared to the other sets being under consideration, can lead to a lower level of cooperation and are, therefore, more effective in changing the strategies of the other nodes. The obtained results can be considered in the treatment of cancer. So that, destroying the tumoral cells with the highest control power should be a priority as these cells have a higher capability to change the strategies of the other cells from cooperators to free-riders (healthy to tumoral).

Fully Distributed Synchronization of Dynamic Networked Systems With Adaptive Nonlinear Couplings

In this article, we consider the distributed synchronization problem of dynamic networked systems with adaptive nonlinear couplings. Based on how the information is collected, the interactions between subsystems are characterized by nonlinear relative state couplings and nonlinear absolute state couplings. In both cases, we show that the considered nonlinear interactions can be used to simulate the couplings with disturbed relative or absolute states. In order to implement the nonlinear couplings in a fully distributed fashion, adaptive control laws are proposed for the adjustment of coupling strengths between connected subsystems. It is shown that the connected network topology is sufficient to ensure the synchronization of dynamic networked systems with the proposed adaptive nonlinear coupling methods. Different from many existing works, the σ -modification technique is used to suppress the increase of the coupling strengths with an additional benefit of preventing the coupling strengths from increasing. Simulation examples are given to assess the performance of the proposed adaptive nonlinear couplings.

The evolving topology of the Lightning Network: Centralization, efficiency, robustness, synchronization, and anonymity

The Lightning Network (LN) was released on Bitcoin’s mainnet in January 2018 as a solution to favor scalability. This work analyses the evolution of the LN during its first year of existence in order to assess its impact over some of the core fundamentals of Bitcoin, such as: node centralization, resilience against attacks and disruptions, anonymity of users, autonomous coordination of its members. Using a network theory approach, we find that the LN represents a centralized configuration with few highly active nodes playing as hubs in that system. We show that the removal of these central nodes is likely to generate a remarkable drop in the LN’s efficiency, while the network appears robust to random disruptions. In addition, we observe that improvements in efficiency during the sample period are primarily due to the increase in the capacity installed on the channels, while nodes’ synchronization does not emerge as a distinctive feature of the LN. Finally, the analysis of the structure of the network suggests a good preservation of nodes’ identity against attackers with prior knowledge about topological characteristics of their targets, but also that LN is probably weak against attackers that are within the system.

Spontaneous electromagnetic induction promotes the formation of economical neuronal network structure via self-organization process

Developed through evolution, brain neural system self-organizes into an economical and dynamic network structure with the modulation of repetitive neuronal firing activities through synaptic plasticity. These highly variable electric activities inevitably produce a spontaneous magnetic field, which also significantly modulates the dynamic neuronal behaviors in the brain. However, how this spontaneous electromagnetic induction affects the self-organization process and what is its role in the formation of an economical neuronal network still have not been reported. Here, we investigate the effects of spontaneous electromagnetic induction on the self-organization process and the topological properties of the self-organized neuronal network. We first find that spontaneous electromagnetic induction slows down the self-organization process of the neuronal network by decreasing the neuronal excitability. In addition, spontaneous electromagnetic induction can result in a more homogeneous directed-weighted network structure with lower causal relationship and less modularity which supports weaker neuronal synchronization. Furthermore, we show that spontaneous electromagnetic induction can reconfigure synaptic connections to optimize the economical connectivity pattern of self-organized neuronal networks, endowing it with enhanced local and global efficiency from the perspective of graph theory. Our results reveal the critical role of spontaneous electromagnetic induction in the formation of an economical self-organized neuronal network and are also helpful for understanding the evolution of the brain neural system.

State Estimation for General Complex Dynamical Networks with Incompletely Measured Information

Estimating uncertain state variables of a general complex dynamical network with randomly incomplete measurements of transmitted output variables is investigated in this paper. The incomplete measurements, occurring randomly through the transmission of output variables, always cause the failure of the state estimation process. Different from the existing methods, we propose a novel method to handle the incomplete measurements, which can perform well to balance the excessively deviated estimators under the influence of incomplete measurements. In particular, the proposed method has no special limitation on the node dynamics compared with many existing methods. By employing the Lyapunov stability theory along with the stochastic analysis method, sufficient criteria are deduced rigorously to ensure obtaining the proper estimator gains with known model parameters. Illustrative simulation for the complex dynamical network composed of chaotic nodes are given to show the validity and efficiency of the proposed method.

Optimizing Dynamical Network Structure for Pinning Control

Controlling dynamics of a network from any initial state to a final desired state has many applications in different disciplines from engineering to biology and social sciences. In this work, we optimize the network structure for pinning control. The problem is formulated as four optimization tasks: i) optimizing the locations of driver nodes, ii) optimizing the feedback gains, iii) optimizing simultaneously the locations of driver nodes and feedback gains, and iv) optimizing the connection weights. A newly developed population-based optimization technique (cat swarm optimization) is used as the optimization method. In order to verify the methods, we use both real-world networks, and model scale-free and small-world networks. Extensive simulation results show that the optimal placement of driver nodes significantly outperforms heuristic methods including placing drivers based on various centrality measures (degree, betweenness, closeness and clustering coefficient). The pinning controllability is further improved by optimizing the feedback gains. We also show that one can significantly improve the controllability by optimizing the connection weights.

SYNCHRONIZATION OF HETEROGENEOUS OSCILLATORS UNDER NETWORK MODIFICATIONS: PERTURBATION AND OPTIMIZATION OF THE SYNCHRONY ALIGNMENT FUNCTION

Synchronization is central to many complex systems in engineering physics (e.g., the power-grid, Josephson junction circuits, and electro-chemical oscillators) and biology (e.g., neuronal, circadian, and cardiac rhythms). Despite these widespread applications-for which proper functionality depends sensitively on the extent of synchronization-there remains a lack of understanding for how systems can best evolve and adapt to enhance or inhibit synchronization. We study how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems. Our approach relies on a synchrony alignment function (SAF) that quantifies the interplay between heterogeneity of the network and of the oscillators and provides an objective measure for a system's ability to synchronize. We conduct a spectral perturbation analysis of the SAF for structural network modifications including the addition and removal of edges, which subsequently ranks the edges according to their importance to synchronization. Based on this analysis, we develop gradient-descent algorithms to efficiently solve optimization problems that aim to maximize phase synchronization via network modifications. We support these and other results with numerical experiments.

Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains

Controlling complex networks is of paramount importance in science and engineering. Despite recent efforts to improve controllability and synchronous strength, little attention has been paid to the speed of pinning synchronizability (rate of convergence in pinning control) and the corresponding pinning node selection. To address this issue, we propose a hypothesis to restrict the control cost, then build a linear matrix inequality related to the speed of pinning controllability. By solving the inequality, we obtain both the speed of pinning controllability and optimal control strength (feedback gains in pinning control) for all nodes. Interestingly, some low-degree nodes are able to achieve large feedback gains, which suggests that they have high influence on controlling system. In addition, when choosing nodes with high feedback gains as pinning nodes, the controlling speed of real systems is remarkably enhanced compared to that of traditional large-degree and large-betweenness selections. Thus, the proposed approach provides a novel way to investigate the speed of pinning controllability and can evoke other effective heuristic pinning node selections for large-scale systems.

Adding connections can hinder network synchronization of time-delayed oscillators

We provide experimental evidence that adding links to a network's structure can hinder synchronization. Our experiments and theoretical analysis of networks of time-delayed optoelectronic oscillators uncover the scenario of loss of identical synchronization upon connectivity modifications. This counterintuitive loss of synchronization can occur even when the network structure is improved from a connectivity perspective. Utilizing a master stability function approach, we show that a time delay in the coupling of nodes plays a crucial role in determining a network's synchronization properties and that this effect is more prominent in directed networks than in undirected networks, especially for large networks. Our results provide insight into the impact of structural modifications in networks with equal coupling delays and open the path to design changes to the network connectivity to sustain and control the performance of real-world networks.

Improving Network Structure can lead to Functional Failures

In many real-world networks the ability to synchronize is a key property for their performance. Recent work on undirected networks with diffusive interaction revealed that improvements in the network connectivity such as making the network more connected and homogeneous enhances synchronization. However, real-world networks have directed and weighted connections. In such directed networks, understanding the impact of structural changes on the network performance remains a major challenge. Here, we show that improving the structure of a directed network can lead to a failure in the network function. For instance, introducing new links to reduce the minimum distance between nodes can lead to instabilities in the synchronized motion. This effect only occurs in directed networks. Our results allow to identify the dynamical importance of a link and thereby have a major impact on the design and control of directed networks.

Optimal pinning controllability of complex networks: dependence on network structure

Controlling networked structures has many applications in science and engineering. In this paper, we consider the problem of pinning control (pinning the dynamics into the reference state), and optimally placing the driver nodes, i.e., the nodes to which the control signal is fed. Considering the local controllability concept, a metric based on the eigenvalues of the Laplacian matrix is taken into account as a measure of controllability. We show that the proposed optimal placement strategy considerably outperforms heuristic methods including choosing hub nodes with high degree or betweenness centrality as drivers. We also study properties of optimal drivers in terms of various centrality measures including degree, betweenness, closeness, and clustering coefficient. The profile of these centrality values depends on the network structure. For homogeneous networks such as random small-world networks, the optimal driver nodes have almost the mean centrality value of the population (much lower than the centrality value of hub nodes), whereas the centrality value of optimal drivers in heterogeneous networks such as scale-free ones is much higher than the average and close to that of hub nodes. However, as the degree of heterogeneity decreases in such networks, the profile of centrality approaches the population mean.