目标可控性:复杂网络中的前馈贪婪算法,满足卡尔曼的等级条件。

Seyedeh Fatemeh Khezri, Ali Ebrahimi, Changiz Eslahchi
{"title":"目标可控性:复杂网络中的前馈贪婪算法,满足卡尔曼的等级条件。","authors":"Seyedeh Fatemeh Khezri, Ali Ebrahimi, Changiz Eslahchi","doi":"10.1093/bioinformatics/btae630","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>The concept of controllability within complex networks is pivotal in determining the minimal set of driver vertices required for the exertion of external signals, thereby enabling control over the entire network's vertices. Target controllability further refines this concept by focusing on a subset of vertices within the network as the specific targets for control, both of which are known to be NP-hard problems. Crucially, the effectiveness of the driver set in achieving control of the network is contingent upon satisfying a specific rank condition, as introduced by Kalman. On the other hand, structural controllability provides a complementary approach to understanding network control, emphasizing the identification of driver vertices based on the network's structural properties. However, in structural controllability approaches, the Kalman condition may not always be satisfied.</p><p><strong>Results: </strong>In this study, we address the challenge of target controllability by proposing a feed-forward greedy algorithm designed to efficiently handle large networks while meeting the Kalman controllability rank condition. We further enhance our method's efficacy by integrating it with Barabasi et al.'s structural controllability approach. This integration allows for a more comprehensive control strategy, leveraging both the dynamical requirements specified by Kalman's rank condition and the structural properties of the network. Empirical evaluation across various network topologies demonstrates the superior performance of our algorithms compared to existing methods, consistently requiring fewer driver vertices for effective control. Additionally, our method's application to protein-protein interaction networks associated with breast cancer reveals potential drug repurposing candidates, underscoring its biomedical relevance. This study highlights the importance of addressing both structural and dynamical aspects of network controllability for advancing control strategies in complex systems.</p><p><strong>Availability and implementation: </strong>The source code is available for free at:Https://github.com/fatemeKhezry/targetControllability.</p>","PeriodicalId":93899,"journal":{"name":"Bioinformatics (Oxford, England)","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11568069/pdf/","citationCount":"0","resultStr":"{\"title\":\"Target controllability: a feed-forward greedy algorithm in complex networks, meeting Kalman's rank condition.\",\"authors\":\"Seyedeh Fatemeh Khezri, Ali Ebrahimi, Changiz Eslahchi\",\"doi\":\"10.1093/bioinformatics/btae630\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Motivation: </strong>The concept of controllability within complex networks is pivotal in determining the minimal set of driver vertices required for the exertion of external signals, thereby enabling control over the entire network's vertices. Target controllability further refines this concept by focusing on a subset of vertices within the network as the specific targets for control, both of which are known to be NP-hard problems. Crucially, the effectiveness of the driver set in achieving control of the network is contingent upon satisfying a specific rank condition, as introduced by Kalman. On the other hand, structural controllability provides a complementary approach to understanding network control, emphasizing the identification of driver vertices based on the network's structural properties. However, in structural controllability approaches, the Kalman condition may not always be satisfied.</p><p><strong>Results: </strong>In this study, we address the challenge of target controllability by proposing a feed-forward greedy algorithm designed to efficiently handle large networks while meeting the Kalman controllability rank condition. We further enhance our method's efficacy by integrating it with Barabasi et al.'s structural controllability approach. This integration allows for a more comprehensive control strategy, leveraging both the dynamical requirements specified by Kalman's rank condition and the structural properties of the network. Empirical evaluation across various network topologies demonstrates the superior performance of our algorithms compared to existing methods, consistently requiring fewer driver vertices for effective control. Additionally, our method's application to protein-protein interaction networks associated with breast cancer reveals potential drug repurposing candidates, underscoring its biomedical relevance. This study highlights the importance of addressing both structural and dynamical aspects of network controllability for advancing control strategies in complex systems.</p><p><strong>Availability and implementation: </strong>The source code is available for free at:Https://github.com/fatemeKhezry/targetControllability.</p>\",\"PeriodicalId\":93899,\"journal\":{\"name\":\"Bioinformatics (Oxford, England)\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11568069/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bioinformatics (Oxford, England)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/bioinformatics/btae630\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bioinformatics (Oxford, England)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/btae630","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

动机复杂网络中的可控性概念对于确定施加外部信号所需的最小驱动顶点集,从而实现对整个网络顶点的控制至关重要。目标可控性进一步完善了这一概念,将网络中的一个顶点子集作为特定的控制目标。最重要的是,驱动集能否有效实现对网络的控制,取决于是否满足卡尔曼提出的特定秩条件。另一方面,结构可控性为理解网络控制提供了一种补充方法,它强调根据网络的结构特性识别驱动顶点。然而,在结构可控性方法中,卡尔曼条件不一定总能得到满足:在本研究中,我们提出了一种前馈贪婪算法,旨在高效处理大型网络,同时满足卡尔曼可控性等级条件,从而应对目标可控性的挑战。我们通过将该方法与 Barabasi 等人的结构可控性方法相结合,进一步提高了该方法的功效。通过这种整合,我们可以利用卡尔曼等级条件规定的动态要求和网络的结构特性,制定更全面的控制策略。对各种网络拓扑结构的经验评估表明,与现有方法相比,我们的算法性能更优越,始终需要更少的驱动顶点来实现有效控制。此外,我们的方法在与乳腺癌相关的蛋白质-蛋白质相互作用网络中的应用揭示了潜在的候选药物再利用,强调了其生物医学相关性。这项研究强调了解决网络可控性的结构和动态两方面问题对于推进复杂系统控制策略的重要性:源代码可在Https://github.com/fatemeKhezry/targetControllability.Supplementary information:补充数据可在 Bioinformatics online 上获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Target controllability: a feed-forward greedy algorithm in complex networks, meeting Kalman's rank condition.

Motivation: The concept of controllability within complex networks is pivotal in determining the minimal set of driver vertices required for the exertion of external signals, thereby enabling control over the entire network's vertices. Target controllability further refines this concept by focusing on a subset of vertices within the network as the specific targets for control, both of which are known to be NP-hard problems. Crucially, the effectiveness of the driver set in achieving control of the network is contingent upon satisfying a specific rank condition, as introduced by Kalman. On the other hand, structural controllability provides a complementary approach to understanding network control, emphasizing the identification of driver vertices based on the network's structural properties. However, in structural controllability approaches, the Kalman condition may not always be satisfied.

Results: In this study, we address the challenge of target controllability by proposing a feed-forward greedy algorithm designed to efficiently handle large networks while meeting the Kalman controllability rank condition. We further enhance our method's efficacy by integrating it with Barabasi et al.'s structural controllability approach. This integration allows for a more comprehensive control strategy, leveraging both the dynamical requirements specified by Kalman's rank condition and the structural properties of the network. Empirical evaluation across various network topologies demonstrates the superior performance of our algorithms compared to existing methods, consistently requiring fewer driver vertices for effective control. Additionally, our method's application to protein-protein interaction networks associated with breast cancer reveals potential drug repurposing candidates, underscoring its biomedical relevance. This study highlights the importance of addressing both structural and dynamical aspects of network controllability for advancing control strategies in complex systems.

Availability and implementation: The source code is available for free at:Https://github.com/fatemeKhezry/targetControllability.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信