Structural Controllability of Symmetric Networks

Structural Controllability of Symmetric Networks
复制标题

DOI:
10.1109/tac.2018.2881112
复制
发表时间:
2019-09-01
影响因子:
6.8
通讯作者:
Pasqualetti, Fabio
Pasqualetti, Fabio
中科院分区:
计算机科学2区
文献类型:
--
作者:
Menara, Tommaso;Bassett, Danielle S.;Pasqualetti, Fabio

文献摘要

被引文献

相似文献

结构可控性理论允许我们评估网络的可控性作为其互连图的函数,并且独立于边权重。然而,现有的结构可控性的结果需要的权重被任意选择,彼此独立,并提供不保证时,这些条件不满足。在这篇文章中,我们发展了一个新的理论,结构可控性的网络对称,从而约束,重量。首先,我们表明,网络的可控性仍然是一个通用的属性,即使当权重是对称的。然后,我们刻画了具有对称权的网络结构可控的图论充分必要条件:一个对称网络是结构可控的当且仅当它是结构可控的,没有重量限制。最后,我们使用我们的研究结果来评估结构的可控性,从一个区域的一类的神经重建的大脑网络。
The theory of structural controllability allows us to assess controllability of a network as a function of its interconnection graph and independently of the edge weights. Yet, existing structural controllability results require the weights to be selected arbitrarily and independently from one another and provide no guarantees when these conditions are not satisfied. In this note, we develop a new theory for structural controllability of networks with symmetric, thus constrained, weights. First, we show that network controllability remains a generic property even when the weights are symmetric. Then, we characterize necessary and sufficient graph-theoretic conditions for structural controllability of networks with symmetric weights: a symmetric network is structurally controllable if and only if it is structurally controllable without weight constraints. Finally, we use our results to assess structural controllability from one region of a class of empirically-reconstructed brain networks.