Suppr超能文献

复杂网络的最小能量控制

Minimum energy control for complex networks.

作者信息

Lindmark Gustav, Altafini Claudio

机构信息

Division of Automatic Control, Dept. of Electrical Engineering, Linköping University, SE-58183, Linköping, Sweden.

出版信息

Sci Rep. 2018 Feb 16;8(1):3188. doi: 10.1038/s41598-018-21398-7.

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.

摘要

本文的目的是阐明以最小控制能量控制复杂网络的问题。我们首先表明,控制能量取决于网络模式的时间常数,并且复平面上的特征值离虚轴越近,实现完全可控性所需的能量就越少。在所有特征值均为纯虚数的网络的极限情况下(例如耦合谐波振荡器网络),开发了几种用于最小控制能量驱动节点选择的构造性算法。还提出了适用于任何有向网络的一般启发式原则:当控制集中在加权出度与入度之比最高的节点上时,控制网络的总成本会降低。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验