在有界度DAG上广播
Broadcasting on Bounded Degree DAGs
摘要:
我们研究了著名的树上广播模型的以下推广。考虑具有唯一源节点$X$的无限有向无环图(DAG)。让在距离$X$ $k$处的节点集合被称为第$k$层。在时间零,源节点被给予一个位。在时间$k\geq 1$,第$(k-1)$层中的每个节点检查其输入并向第$k$层中的其后代发送比特。每个比特在传输过程中以错误概率$δ\in \left(0,\frac{1}{2}\right)$翻转。目标是能够从任意深层$k$的所有节点的值中以优于$\frac{1}{2}$的错误概率恢复原始比特。除了其自然的广播解释之外,DAG广播是噪声计算的自然模型。该模型的一些特殊情况代表生物网络中的信息流,其他情况代表有噪声的有限自动机模型。我们发现,存在有界度和层的大小$ω(\log(k))$,允许恢复提供$δ$是足够小的DAG,并找到关键的$δ$的DAG构建。我们的研究结果表明,双指数的优势,存储位在有界度DAG相比,树。在消极的一面,我们表明,如果DAG是一个二维的规则网格,然后恢复是不可能的任何$δ\in \left(0,\frac{1}{2}\right)$提供所有节点使用AND或XOR的处理功能。
英文摘要:
We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node $X$. Let the collection of nodes at distance $k$ from $X$ be called the $k$th layer. At time zero, the source node is given a bit. At time $k\geq 1$, each node in the $(k-1)$th layer inspects its inputs and sends a bit to its descendants in the $k$th layer. Each bit is flipped with a probability of error $δ\in \left(0,\frac{1}{2}\right)$ in the process of transmission. The goal is to be able to recover the original bit with probability of error better than $\frac{1}{2}$ from the values of all nodes at an arbitrarily deep layer $k$. Besides its natural broadcast interpretation, the DAG broadcast is a natural model of noisy computation. Some special cases of the model represent information flow in biological networks, and other cases represent noisy finite automata models. We show that there exist DAGs with bounded degree and layers of size $ω(\log(k))$ that permit recovery provided $δ$ is sufficiently small and find the critical $δ$ for the DAGs constructed. Our result demonstrates a doubly-exponential advantage for storing a bit in bounded degree DAGs compared to trees. On the negative side, we show that if the DAG is a two-dimensional regular grid, then recovery is impossible for any $δ\in \left(0,\frac{1}{2}\right)$ provided all nodes use either AND or XOR for their processing functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。