arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.03082eess.SYcs.SIcs.SYmath.OCphysics.soc-ph
收藏

复杂网络的最小能量控制

Minimum energy control for complex networks

Linköping University(林雪平大学)

Gustav Lindmark, Claudio Altafini

AI总结:

本文研究复杂网络的最小能量控制问题,提出基于节点出度与入度比的控制策略,降低控制成本。

摘要:

本文旨在探讨如何以最小控制能量控制复杂网络。首先证明控制能量取决于网络模式的时间常数,且网络特征值越接近复平面虚轴,完全可控所需的能量越少。在所有特征值为纯虚数的极限情况下(如耦合谐振子网络),提出几种构造性算法用于最小控制能量的驱动节点选择。还提出一个适用于任意有向网络的一般启发式原则:当控制集中于出度与入度比最高的节点时,网络控制成本降低。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑