“School of Biological”
Back to Papers HomeBack to Papers of School of Biological
| Paper IPM / Biological / 17946 |
|
||||||
| Abstract: | |||||||
|
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.
Download TeX format |
|||||||
| back to top | |||||||
