“School of Biological Sciences”

Back to Papers Home
Back to Papers of School of Biological Sciences

Paper   IPM / Biological Sciences / 17946
School of Biological Sciences
  Title:   Target Controllability: a Feed-Forward Greedy Algorithm in Complex Networks, Meeting Kalman’s Rank Condition
  Author(s): 
1.  Seyedeh Fatemeh Khezri
2.  Ali Ebrahimi
3.  Changiz Eslahchi
  Status:   Published
  Journal: Bioinformatics
  Year:  2024
  Supported by:  IPM
  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
scroll left or right