关于布尔网络中观测节点数量的研究
On the Number of Observation Nodes in Boolean Networks
AI总结:
本文研究布尔网络中观测节点数量与可观测性的关系,利用信息熵、状态计数等方法推导了三类布尔网络观测节点数的上下界。
摘要:
如果任何初始状态都能从输出序列中唯一确定,则称布尔网络(BN)是可观测的。在现有关于BN可观测性的文献中,几乎没有研究探讨观测节点数量与BN可观测性之间的关系,而这是一个重要且实际的问题。本文主要关注三类具有$n$个节点的BN(即$K$-AND-OR-BNs、$K$-XOR-BNs和$K$-NC-BNs,其中$K$是每个节点的输入节点数,NC表示嵌套嵌套canalyzing),并研究这些BN的观测节点数量的上下界。首先,我们开发了一种利用信息熵推导观测节点数量一般下界的新技术,并得出结论:为确保任何$K$-AND-OR-BN可观测,观测节点数量不能小于$\left[(1-K)+\frac{2^{K}-1}{2^{K}}\log_{2}(2^{K}-1)\right]n$,类似地,也为$K$-NC-BNs获得了相应的下界。然后,对于任何类型的BN,我们还开发了两种新技术来推断一般下界,分别通过计算时刻1的相同状态数和计算不动点数量来实现。另一方面,通过对几种类型BN的组合分析,我们推导出了观测节点数量的非平凡上界。具体而言,我们指出$\left(\frac{2^{K}-K-1}{2^{K}-1}\right)n$、$1$和$\lceil \frac{n}{K}\rceil$分别是$K$-AND-OR-BNs、$K$-XOR-BNs和$K$-NC-BN的最佳情况上界。
英文摘要:
A Boolean network (BN) is called observable if any initial state can be uniquely determined from the output sequence. In the existing literature on observability of BNs, there is almost no research on the relationship between the number of observation nodes and the observability of BNs, which is an important and practical issue. In this paper, we mainly focus on three types of BNs with $n$ nodes (i.e., $K$-AND-OR-BNs, $K$-XOR-BNs, and $K$-NC-BNs, where $K$ is the number of input nodes for each node and NC means nested canalyzing) and study the upper and lower bounds of the number of observation nodes for these BNs. First, we develop a novel technique using information entropy to derive a general lower bound of the number of observation nodes, and conclude that the number of observation nodes cannot be smaller than $\left[(1-K)+\frac{2^{K}-1}{2^{K}}\log_{2}(2^{K}-1)\right]n$ to ensure that any $K$-AND-OR-BN is observable, and similarly, some lower bound is also obtained for $K$-NC-BNs. Then for any type of BN, we also develop two new techniques to infer the general lower bounds, using counting identical states at time 1 and counting the number of fixed points, respectively. On the other hand, we derive nontrivial upper bounds of the number of observation nodes by combinatorial analysis of several types of BNs. Specifically, we indicate that $\left(\frac{2^{K}-K-1}{2^{K}-1}\right)n,~1$, and $\lceil \frac{n}{K}\rceil$ are the best case upper bounds for $K$-AND-OR-BNs, $K$-XOR-BNs, and $K$-NC-BN, respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。