arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0804.1179cs.DM
收藏

一个动态布尔网络

A Dynamical Boolean Network

Genta Ito

摘要:

我们提出了一个动态布尔网络(DBN),这是一个虚拟布尔网络(VBN)的状态集是固定的,但其转移矩阵可以从一个离散的时间步到另一个变化。时间步$k$的DBN的转移矩阵$T_{k}$的形式为$Q^{-1}TQ$,其中$T$是在DBN的构造过程中在时间步$k$定义的(VBN的)转移矩阵,而$Q$是DBN的状态的某个随机选择的置换$P$的矩阵表示。对于几类这样的排列中的每一类,我们对具有两个节点的DBN进行了多次模拟;我们的每个模拟都由1,000次试验组成,每次试验10,000个时间步长。在我们的一个模拟中,对于一个有两个节点的VBN,16个可能的单节点转换规则中只有6个被访问了30万次(在所有1,000次试验中)。在该模拟中,线性似乎起着重要的作用,因为这六个单节点转移规则中有三个是线性虚拟布尔网络(LVBN)的转移规则;其他三个是前三个的否定。我们还讨论了概率布尔网络和隐马尔可夫模型的概念-在这两种情况下,在使用任意(但不一定是一对一)函数来标记VBN的状态的上下文中。

英文摘要:

We propose a Dynamical Boolean Network (DBN), which is a Virtual Boolean Network (VBN) whose set of states is fixed but whose transition matrix can change from one discrete time step to another. The transition matrix $T_{k}$ of our DBN for time step $k$ is of the form $Q^{-1}TQ$, where $T$ is a transition matrix (of a VBN) defined at time step $k$ in the course of the construction of our DBN and $Q$ is the matrix representation of some randomly chosen permutation $P$ of the states of our DBN. For each of several classes of such permutations, we carried out a number of simulations of a DBN with two nodes; each of our simulations consisted of 1,000 trials of 10,000 time steps each. In one of our simulations, only six of the 16 possible single-node transition rules for a VBN with two nodes were visited a total of 300,000 times (over all 1,000 trials). In that simulation, linearity appears to play a significant role in that three of those six single-node transition rules are transition rules of a Linear Virtual Boolean Network (LVBN); the other three are the negations of the first three. We also discuss the notions of a Probabilistic Boolean Network and a Hidden Markov Model--in both cases, in the context of using an arbitrary (though not necessarily one-to-one) function to label the states of a VBN.

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

↑