Department of Computer and Data Sciences, Shahid Beheshti University, Tehran 1983969411, Iran.
School of Biological Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran 19395-5746, Iran.
Bioinformatics. 2024 Nov 1;40(11). doi: 10.1093/bioinformatics/btae630.
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.
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.
The source code is available for free at:Https://github.com/fatemeKhezry/targetControllability.
在复杂网络中,可控性的概念对于确定施加外部信号所需的最小驱动顶点集至关重要,从而实现对整个网络顶点的控制。目标可控性通过将网络中的顶点子集作为控制的特定目标进一步细化了这一概念,这两个问题都被证明是 NP 难问题。至关重要的是,驱动集在实现网络控制方面的有效性取决于满足 Kalman 引入的特定秩条件。另一方面,结构可控性提供了一种理解网络控制的互补方法,强调基于网络的结构属性识别驱动顶点。然而,在结构可控性方法中,Kalman 条件可能并不总是满足。
在这项研究中,我们通过提出一种前馈贪婪算法来解决目标可控性的挑战,该算法旨在有效地处理大型网络,同时满足 Kalman 可控性秩条件。我们通过将其与 Barabasi 等人的结构可控性方法相结合,进一步提高了我们方法的有效性。这种集成允许采用更全面的控制策略,利用 Kalman 秩条件指定的动力学要求和网络的结构属性。在各种网络拓扑结构上的实证评估表明,我们的算法与现有方法相比具有优越的性能,始终需要更少的驱动顶点来实现有效的控制。此外,我们的方法在与乳腺癌相关的蛋白质-蛋白质相互作用网络上的应用揭示了潜在的药物再利用候选物,强调了其在生物医学中的相关性。这项研究强调了在复杂系统中推进控制策略时,解决网络可控性的结构和动力学方面的重要性。
源代码可免费在以下网址获得:Https://github.com/fatemeKhezry/targetControllability。