arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.04154math.OC
收藏

网络中心性在复杂网络可控性中的作用

On the Role of Network Centrality in the Controllability of Complex Networks

Nicoletta Bof, Giacomo Baggio, Sandro Zampieri

摘要:

近年来,复杂网络在科学和工程的不同领域得到了越来越多的关注。控制这些网络的问题是一个有趣的和具有挑战性的问题进行调查。在本文中,我们着眼于控制所需的能量的可控性问题。准确地说,我们不仅要分析网络是否可以控制,而且还要确定是否可以使用有限的能量进行控制。我们限制我们的研究,不可约和(边缘)稳定的网络,我们发现,领先的右,左特征向量的网络矩阵在此分析中起着至关重要的作用。有趣的是,我们的研究结果表明可控性和网络中心性之间存在联系,这是网络科学中的一个众所周知的概念。在网络是可逆的情况下,后一种连接涉及PageRank,这是一种被广泛研究的中心性度量。最后,将所得结果应用于随机图的例子。

英文摘要:

In recent years complex networks have gained increasing attention in different fields of science and engineering. The problem of controlling these networks is an interesting and challenging problem to investigate. In this paper we look at the controllability problem focusing on the energy needed for the control. Precisely not only we want to analyze whether a network can be controlled, but we also want to establish whether the control can be performed using a limited amount of energy. We restrict our study to irreducible and (marginally) stable networks and we find that the leading right and left eigenvectors of the network matrix play a crucial role in this analysis. Interestingly, our results suggest the existence of a connection between controllability and network centrality, a well-known concept in network science. In case the network is reversible, the latter connection involves the PageRank, an extensively studied type of centrality measure. Finally, the proposed results are applied to examples concerning random graphs.

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

↑