有向图Weakly Connected上合取布尔网络的渐近行为
Asymptotic Behavior of Conjunctive Boolean Networks Over Weakly Connected Digraphs
摘要:
合取布尔网络(CBN)是一个有限状态的动力系统,其变量从一个二进制集合中取值,每个变量的值更新规则是一个仅由逻辑与运算组成的布尔函数。我们通过计算CBN的周期轨道来研究CBN的渐近行为。当底层的有向图是强连通的时,相关CBN的周期轨道已经被完全理解,一一对应于由图的循环数给定的一定长度的二元项链。本文刻画了任意弱连通有向图上CBN的周期轨道。我们建立,除其他事项外,一个新的方法来调查他们的渐近行为。具体来说,我们介绍了一个图形的方法,称为系统减少,它变成一个特殊的弱连接有向图的强连接组件的所有周期的基础有向图。我们证明了约化系统唯一地决定了原系统的渐近行为。此外,我们提供了一个建设性的方法来计算周期轨道的约化系统,该系统将进入一个给定的,但任意的初始条件。
英文摘要:
A conjunctive Boolean network (CBN) is a finite state dynamical system, whose variables take values from a binary set, and the value update rule for each variable is a Boolean function consisting only of logic AND operations. We investigate the asymptotic behavior of CBNs by computing their periodic orbits. When the underlying digraph is strongly connected, the periodic orbits of the associated CBN has been completely understood, one-to-one corresponding to binary necklaces of a certain length given by the loop number of the graph. We characterize in the paper the periodic orbits of CBNs over an arbitrary weakly connected digraphs. We establish, among other things, a new method to investigate their asymptotic behavior. Specifically, we introduce a graphical-approach, termed system reduction, which turns the underlying digraph into a special weakly connected digraph whose strongly connected components are all cycles. We show that the reduced system uniquely determines the asymptotic behavior of the original system. Moreover, we provide a constructive method for computing the periodic orbit of the reduced system, which the system will enter for a given but arbitrary initial condition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。