Computing structural controllability of linearly-coupled complex networks

R. Rajaei, A. Ramezani, B. Shafai
{"title":"Computing structural controllability of linearly-coupled complex networks","authors":"R. Rajaei, A. Ramezani, B. Shafai","doi":"10.1109/HPEC.2017.8091064","DOIUrl":null,"url":null,"abstract":"Structural controllability, as a generic structure-based property in determining the ability of a complex network to reach the desired configuration, is addressed in this work. Using a robust measure derived from robust control theory, this paper deals with structural controllability of a type of weighted network of networks (NetoNets) involving linear couplings between its corresponding networks and clusters. Unlike the structural controllability degrees rooted in graph theory, this paper takes the advantage of uncertain systems to define the notion of structural controllability in a straightforward and less computationally complex way. Moreover, the spectrum of required energy is discussed. Eventually, the results for the proposed measure of structural controllability of scale-free networks are given to justify the proposed measure of an efficient and effective guarantee for fully controllability of the NetoNets in exposure to cluster and network-dependency connections. The proposed measure is an optimal solution according to structural energy-related control of the NetoNet where the upper bound of the required energy is illustrated an efficient measure for structural controllability of the class of NetoNet. Arbitrarily connectivity of low connected vertices to their higher connected counterparts in clusters results in effective controllability. In the same direction, as seminal works in structural controllability of complex networks to avoid the highly-connected nodes, the larger the cluster/network connectivity degree is, the less fully controllability of NetoNet is guaranteed.","PeriodicalId":364903,"journal":{"name":"2017 IEEE High Performance Extreme Computing Conference (HPEC)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE High Performance Extreme Computing Conference (HPEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPEC.2017.8091064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Structural controllability, as a generic structure-based property in determining the ability of a complex network to reach the desired configuration, is addressed in this work. Using a robust measure derived from robust control theory, this paper deals with structural controllability of a type of weighted network of networks (NetoNets) involving linear couplings between its corresponding networks and clusters. Unlike the structural controllability degrees rooted in graph theory, this paper takes the advantage of uncertain systems to define the notion of structural controllability in a straightforward and less computationally complex way. Moreover, the spectrum of required energy is discussed. Eventually, the results for the proposed measure of structural controllability of scale-free networks are given to justify the proposed measure of an efficient and effective guarantee for fully controllability of the NetoNets in exposure to cluster and network-dependency connections. The proposed measure is an optimal solution according to structural energy-related control of the NetoNet where the upper bound of the required energy is illustrated an efficient measure for structural controllability of the class of NetoNet. Arbitrarily connectivity of low connected vertices to their higher connected counterparts in clusters results in effective controllability. In the same direction, as seminal works in structural controllability of complex networks to avoid the highly-connected nodes, the larger the cluster/network connectivity degree is, the less fully controllability of NetoNet is guaranteed.
线性耦合复杂网络结构可控性的计算
结构可控性,作为一种通用的基于结构的性质,在决定一个复杂的网络的能力,以达到所需的配置,是解决在这项工作。利用鲁棒控制理论导出的鲁棒度量,研究了一类加权网络的结构可控性,该网络涉及相应网络和簇之间的线性耦合。与植根于图论的结构可控性度不同,本文利用不确定系统的优势,以一种直接的、计算复杂性较低的方式定义了结构可控性的概念。此外,还讨论了所需能量谱。最后,给出了所提出的无标度网络结构可控性度量的结果,以证明所提出的度量是在暴露于集群和网络依赖连接时netonet完全可控性的有效保证。所提出的方法是根据NetoNet结构能量相关控制的最优解,其中所需能量的上界是一类NetoNet结构可控性的有效措施。簇中低连通点与高连通点的任意连通性导致有效的可控性。同样,作为避免高连接节点的复杂网络结构可控性的开创性工作,集群/网络连通度越大,NetoNet的完全可控性就越不能得到保证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信