基于集体影响的布尔网络的最优镇定
Optimal Stabilization of Boolean Networks through Collective Influence
摘要:
由于布尔网络在描述生物系统动力学方面的广泛应用,布尔网络的稳定性问题引起了人们的广泛关注。在过去的几十年里,人们投入了大量的精力来揭示网络结构和更新规则如何影响布尔网络的稳定性。在本文中,我们的目标是识别和控制一个最小的一组有影响力的节点,能够稳定一个不稳定的布尔网络。通过最小化修正的非回溯矩阵的最大特征值,提出了一种利用集体影响理论识别布尔网络中影响节点的方法,该方法具有较高的计算效率.我们测试了四个不同网络的集体影响力的表现。结果表明,集体影响算法可以稳定每个网络的一个更小的节点集比其他启发式算法。我们的工作为决定布尔网络稳定性的机制提供了新的见解,这可能会在识别导致严重疾病的毒力基因方面找到应用。
英文摘要:
The stability of Boolean networks has attracted much attention due to its wide applications in describing the dynamics of biological systems. During the past decades, much effort has been invested in unveiling how network structure and update rules will affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. By minimizing the largest eigenvalue of a modified non-backtracking matrix, we propose a method using the collective influence theory to identify the influential nodes in Boolean networks with high computational efficiency. We test the performance of collective influence on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes than other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying the virulence genes that lead to serious disease.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。