Optimal pinning controllability of complex networks: dependence on network structure

Low-dimensional controllability of brain networks

Identifying the driver nodes of a network has crucial implications in biological systems from unveiling causal interactions to informing effective intervention strategies. Despite recent advances in network control theory, results remain inaccurate as the number of drivers becomes too small compared to the network size, thus limiting the concrete usability in many real-life applications. To overcome this issue, we introduced a framework that integrates principles from spectral graph theory and output controllability to project the network state into a smaller topological space formed by the Laplacian network structure. Through extensive simulations on synthetic and real networks, we showed that a relatively low number of projected components can significantly improve the control accuracy. By introducing a new low-dimensional controllability metric we experimentally validated our method on N = 6134 human connectomes obtained from the UK-biobank cohort. Results revealed previously unappreciated influential brain regions, enabled to draw directed maps between differently specialized cerebral systems, and yielded new insights into hemispheric lateralization. Taken together, our results offered a theoretically grounded solution to deal with network controllability and provided insights into the causal interactions of the human brain.

Finding influential nodes in networks using pinning control: Centrality measures confirmed with electrochemical oscillators

The spatiotemporal organization of networks of dynamical units can break down resulting in diseases (e.g., in the brain) or large-scale malfunctions (e.g., power grid blackouts). Re-establishment of function then requires identification of the optimal intervention site from which the network behavior is most efficiently re-stabilized. Here, we consider one such scenario with a network of units with oscillatory dynamics, which can be suppressed by sufficiently strong coupling and stabilizing a single unit, i.e., pinning control. We analyze the stability of the network with hyperbolas in the control gain vs coupling strength state space and identify the most influential node (MIN) as the node that requires the weakest coupling to stabilize the network in the limit of very strong control gain. A computationally efficient method, based on the Moore-Penrose pseudoinverse of the network Laplacian matrix, was found to be efficient in identifying the MIN. In addition, we have found that in some networks, the MIN relocates when the control gain is changed, and thus, different nodes are the most influential ones for weakly and strongly coupled networks. A control theoretic measure is proposed to identify networks with unique or relocating MINs. We have identified real-world networks with relocating MINs, such as social and power grid networks. The results were confirmed in experiments with networks of chemical reactions, where oscillations in the networks were effectively suppressed through the pinning of a single reaction site determined by the computational method.

Structural Target Controllability of Brain Networks in Dementia

Controlling the dynamics of large-scale neural circuits might play an important role in aberrant cognitive functioning as found in Alzheimer's disease (AD). Analyzing the disease trajectory changes is of critical relevance when we want to get an understanding of the neurodegenerative disease evolution. Advanced control theory offers a multitude of techniques and concepts that can be easily translated into the dynamic processes governing disease evolution at the patient level, treatment response evaluation and revealing some central mechanisms in brain connectomic networks that drive alterations in these diseases. Two types of controllability - the modal and average controllability - have been applied in brain research to provide the mechanistic explanation of how the brain operates in different cognitive states. In this paper, we apply the concept of target controllability to structural (MRI) connectivity graphs for control (CN), mild cognitive impairment (MCI) and Alzheimer's disease (AD) subjects. In target controllability, only a subset of the network states are steered towards a desired objective. We show the graph-theoretic necessary and sufficient conditions for the structural target controllability of the above-mentioned brain networks and demonstrate that only local topological information is needed for its verification. Certain areas of the brain and corresponding to nodes in the brain network graphs can act as drivers and move the system (brain) into specific states of action. We select first the drivers that ensures the controllability of these networks and since they do not represent the smallest set, we employ the concept of structural target controllability to determine those nodes that can steer a collection of states being representative for the transitions between CN, MCI and AD networks. Our results applied on structural brain networks in dementia suggest that this novel technique can accurately describe the different node roles in controlling trajectories of brain networks and being relevant for disease evolution.

Hierarchical Two-Layer Distributed Control Architecture for Voltage Regulation in Multiple Microgrids in the Presence of Time-Varying Delays

The Multiple Microgrids (MMGs) concept has been identified as a promising solution for the management of large-scale power grids in order to maximize the use of widespread renewable energies sources. However, its deployment in realistic operation scenarios is still an open issue due to the presence of non-ideal and unreliable communication systems that allow each component within the power network to share information about its state. Indeed, due to technological constraints, multiple time-varying communication delays consistently appear during data acquisition and the transmission process and their effects must be considered in the control design phase. To this aim, this paper addresses the voltage regulation control problem for MMGs systems in the presence of time-varying communication delays. To solve this problem, we propose a novel hierarchical two-layer distributed control architecture that accounts for the presence of communication latencies in the information exchange. More specifically, the upper control layer aims at guaranteeing a proper and economical reactive power dispatch among MMGs, while the lower control layer aims at ensuring voltage regulation of all electrical buses within each MG to the desired voltage set-point. By leveraging a proper Driver Generator Nodes Selection Algorithm, we first provide the best choice of generator nodes which, considering the upper layer control goal, speeds up the voltage synchronization process of all the buses within each MG to the voltage set-point computed by the upper-control layer. Then, the lower control layer, on the basis of this desired voltage value, drives the reactive power capability of each smart device within each MG and compensates for possible voltage deviations. Simulation analysis is carried out on the realistic case study of an MMGs system consisting of two identical IEEE 14-bus test systems and the numerical results disclose the effectiveness of the proposed control strategy, as well as its robustness with respect to load fluctuations.

Feedback pinning control of collective behaviors aroused by epidemic spread on complex networks

This paper investigates feedback pinning control of synchronization behaviors aroused by epidemic spread on complex networks. Based on the quenched mean field theory, epidemic control synchronization models with the inhibition of contact behavior are constructed, combined with the epidemic transmission system and the adaptive dynamical network carrying active controllers. By the properties of convex functions and the Gerschgorin theorem, the epidemic threshold of the model is obtained, and the global stability of disease-free equilibrium is analyzed. For individual's infected situation, when an epidemic disease spreads, two types of feedback control strategies depending on the diseases' information are designed: the first one only adds controllers to infected individuals, and the other adds controllers to both infected and susceptible ones. By using the Lyapunov stability theory, under designed controllers, some criteria that guarantee the epidemic controlled synchronization system achieving behavior synchronization are also derived. Several numerical simulations are performed to show the effectiveness of our theoretical results. As far as we know, this is the first work to address the controlled behavioral synchronization induced by epidemic spread under the pinning feedback mechanism. It is hopeful that we may have deeper insights into the essence between the disease's spread and collective behavior under active control in complex dynamical networks.

Cluster Synchronization for Interacting Clusters of Nonidentical Nodes via Intermittent Pinning Control

The cluster synchronization problem is investigated using intermittent pinning control for the interacting clusters of nonidentical nodes that may represent either general linear systems or nonlinear oscillators. These nodes communicate over general network topology, and the nodes from different clusters are governed by different self-dynamics. A unified convergence analysis is provided to analyze the synchronization via intermittent pinning controllers. It is observed that the nodes in different clusters synchronize to the given patterns if a directed spanning tree exists in the underlying topology of every extended cluster (which consists of the original cluster of nodes as well as their pinning node) and one algebraic condition holds. Structural conditions are then derived to guarantee such an algebraic condition. That is: 1) if the intracluster couplings are with sufficiently strong strength and the pinning controller is with sufficiently long execution time in every period, then the algebraic condition for general linear systems is warranted and 2) if every cluster is with the sufficiently strong intracluster coupling strength, then the pinning controller for nonlinear oscillators can have its execution time to be arbitrarily short. The lower bounds are explicitly derived both for these coupling strengths and the execution time of the pinning controller in every period. In addition, in regard to the above-mentioned structural conditions for nonlinear systems, an adaptive law is further introduced to adapt the intracluster coupling strength, such that the cluster synchronization for nonlinear systems is achieved.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks

In this paper, we propose a novel algorithm—parallel adaptive quantum genetic algorithm—which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

The amyloid interactome: Exploring protein aggregation

Protein-protein interactions are the quintessence of physiological activities, but also participate in pathological conditions. Amyloid formation, an abnormal protein-protein interaction process, is a widespread phenomenon in divergent proteins and peptides, resulting in a variety of aggregation disorders. The complexity of the mechanisms underlying amyloid formation/amyloidogenicity is a matter of great scientific interest, since their revelation will provide important insight on principles governing protein misfolding, self-assembly and aggregation. The implication of more than one protein in the progression of different aggregation disorders, together with the cited synergistic occurrence between amyloidogenic proteins, highlights the necessity for a more universal approach, during the study of these proteins. In an attempt to address this pivotal need we constructed and analyzed the human amyloid interactome, a protein-protein interaction network of amyloidogenic proteins and their experimentally verified interactors. This network assembled known interconnections between well-characterized amyloidogenic proteins and proteins related to amyloid fibril formation. The consecutive extended computational analysis revealed significant topological characteristics and unraveled the functional roles of all constituent elements. This study introduces a detailed protein map of amyloidogenicity that will aid immensely towards separate intervention strategies, specifically targeting sub-networks of significant nodes, in an attempt to design possible novel therapeutics for aggregation disorders.

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.

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.

Communicability angles reveal critical edges for network consensus dynamics

We consider the question of determining how the topological structure influences a consensus dynamical processes taking place on a network. By considering a large data set of real-world networks we first determine that the removal of edges according to their communicability angle, an angle between position vectors of the nodes in an Euclidean communicability space, increases the average time of consensus by a factor of 5.68 in real-world networks. The edge betweenness centrality also identifies, in a smaller proportion, those critical edges for the consensus dynamics; i.e., its removal increases the time of consensus by a factor of 3.70. We justify theoretically these findings on the basis of the role played by the algebraic connectivity and the isoperimetric number of networks on the dynamical process studied and their connections with the properties mentioned before. Finally, we study the role played by global topological parameters of networks on the consensus dynamics. We determine that the network density and the average distance-sum, which is analogous of the node degree for shortest-path distances, account for more than 80% of the variance of the average time of consensus in the real-world networks studied.