Minimum energy control for complex networks

Abstract

The aim of this paper is to shed light on the problem of controlling a complex network with minimal control energy. We show first that the control energy depends on the time constant of the modes of the network, and that the closer the eigenvalues are to the imaginary axis of the complex plane, the less energy is required for complete controllability. In the limit case of networks having all purely imaginary eigenvalues (e.g. networks of coupled harmonic oscillators), several constructive algorithms for minimum control energy driver node selection are developed. A general heuristic principle valid for any directed network is also proposed: the overall cost of controlling a network is reduced when the controls are concentrated on the nodes with highest ratio of weighted outdegree vs indegree.

47 pages, 15 figures

References in corpus (1)

• Layer aggregation and reducibility of multilayer interconnected networks

Cited by in corpus (12)

• Data-Driven Control of Complex Networks
• Functional target controllability of networks: structural properties and efficient algorithms
• Centrality measures and the role of non-normality for network control energy reduction
• New Phenomena in Large-Scale Internet Traffic
• Optimizing target nodes selection for the control energy of directed complex networks
• Energy cost study for controlling complex social networks with conformity behavior
• Pinning control of chimera states in systems with higher-order interactions
• Altering nodes types in controlling complex networks
• Low-dimensional controllability of brain networks
• Partial controllability of network dynamical systems with unilateral inputs
• Optimal control of complex networks with conformity behavior
• Input design for the optimal control of networked moments