arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.01411eess.SYcs.SYmath.LO
收藏

布尔网络钉扎控制的一种新方法

A New Approach to Pinning Control of Boolean Networks

Jie Zhong, Daniel W. C. Ho, Jianquan Lu

摘要:

布尔网络是一种离散时间系统,节点之间相互连接(这里我们称这种连接规则为网络结构),每个基因节点的动力学行为由逻辑函数决定。本文提出了一种新的基于神经网络结构的钉扎控制设计方法,即基于网络结构的分布式钉扎控制。通过删除最小数量的边,网络结构变得无环。然后,一个有效的分布式钉扎控制的设计,以实现全局稳定。与现有文献相比,钉扎控制的设计不是基于状态转移矩阵。因此,本文中的计算复杂度从$O(2^n\times 2^n)$降低到$O(2\times 2^K)$,其中$n$是节点的数目,$K\leq n$是节点的最大内邻居数目。另外,由于不需要状态转移矩阵,不再需要全局状态信息,钉扎控制的设计仅基于邻居的局部信息,易于实现。所提出的方法是很好地证明了几个不同大小的生物网络。结果表明,该方法简单明了,而传统的钉扎控制方法不能适用于维数如此之大的BN。

英文摘要:

Boolean networks (BNs) are discrete-time systems where nodes are inter-connected (here we call such connection rule among nodes as network structure), and the dynamics of each gene node is determined by logical functions. In this paper, we propose a new approach on pinning control design for global stabilization of BNs based on BNs' network structure, named as network-structure-based distributed pinning control. By deleting the minimum number of edges, the network structure becomes acyclic. Then, an efficient distributed pinning control is designed to achieve global stabilization. Compared with existing literature, the design of pinning control is not based on the state transition matrix of BNs. Hence, the computational complexity in this paper is reduced from $O(2^n\times 2^n)$ to $O(2\times 2^K)$, where $n$ is the number of nodes and $K\leq n$ is the largest number of in-neighbors of nodes. In addition, without using state transition matrix, global state information is no longer needed, the design of pinning control is just based on neighbors' local information, which is easier to be implemented. The proposed method is well demonstrated by several biological networks with different sizes. The results are shown to be simple and concise, while the traditional pinning control can not be applied for BNs with such a large dimension.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑