Effect of correlations on network controllability

Abstract

A dynamical system is controllable if by imposing appropriate external signals on a subset of its nodes, it can be driven from any initial state to any desired state in finite time. Here we study the impact of various network characteristics on the minimal number of driver nodes required to control a network. We find that clustering and modularity have no discernible impact, but the symmetries of the underlying matching problem can produce linear, quadratic or no dependence on degree correlation coefficients, depending on the nature of the underlying correlations. The results are supported by numerical simulations and help narrow the observed gap between the predicted and the observed number of driver nodes in real networks.

References in corpus (8)

• Uncovering the overlapping community structure of complex networks in nature and society
• Community structure in directed networks
• Pinning-controllability of complex networks
• Controlling edge dynamics in complex networks
• Controlling complex networks: How much energy is needed?
• Hierarchy measure for complex networks
• Equilibrium statistical mechanics of network structures
• Extremal Properties of Random Structures

Cited by in corpus (32)

• Structure and dynamics of molecular networks: A novel paradigm of drug discovery. A comprehensive review
• Control Principles of Complex Networks
• Optimally controlling the human connectome: the role of network topology
• Emergence of bimodality in controlling complex networks
• Control of Dynamics in Brain Networks
• Network Controllability Is Determined by the Density of Low In-Degree and Out-Degree Nodes
• Control of coupled oscillator networks with application to microgrid technologies
• Controllability of multiplex, multi-timescale networks
• Control of Multilayer Networks
• Predicting Network Controllability Robustness: A Convolutional Neural Network Approach
• A Learning Convolutional Neural Network Approach for Network Robustness Prediction
• Knowledge-Based Prediction of Network Controllability Robustness
• Controllability and maximum matchings of complex networks
• Assortative mixing enhances the irreversible nature of explosive synchronization in growing scale-free networks
• Towards Optimal Robustness of Network Controllability: An Empirical Necessary Condition
• A Framework of Hierarchical Attacks to Network Controllability
• Efficient target control of complex networks based on preferential matching
• Input graph: the hidden geometry in controlling complex networks
• Noise Response Data Reveal Novel Controllability Gramian for Nonlinear Network Dynamics
• Controlling the efficiency of trapping in treelike fractals
• SPP-CNN: An Efficient Framework for Network Robustness Prediction
• Impulse-induced localized control of chaos in starlike networks
• Manipulation of extreme events on scale-free networks
• Observability transitions in correlated networks
• Diversity of structural controllability of complex networks with given degree sequence
• Controllability and Fraction of Leaders in Infinite Network
• The evolution of network controllability in growing networks
• Coexistence of phases and the observability of random graphs
• The network asymmetry caused by the degree correlation and its effect on the bimodality in control
• Steering complex networks toward desired dynamics
• Controlling Networks of Nonlinearly-Coupled Nodes using Response Surfaces
• Optimal control of complex networks with conformity behavior