arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.09532cs.DCcs.CC
收藏

人口协议的消息复杂性

Message complexity of population protocols

Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, Eric Severson

摘要:

标准的群体协议模型假设当两个代理交互时,每个代理都观察另一个代理的整个状态。我们开始研究人口协议的$\textit{message complexity}$,其中代理的状态被分为一个外部可见的$\textit{message}$和一个内部组件,其中只有消息可以观察到的其他代理在交互。我们考虑$O(1)$消息复杂性的情况。当时间是不受限制的,我们得到一个精确的表征的稳定可计算的谓词的内部状态$s(n)$的数量的基础上:如果$s(n) = o(n)$,那么协议计算半线性谓词(不像原来的模型,它可以计算非半线性谓词与$s(n) = O(\log n)$),否则它计算一个谓词可判定的非确定性$O(n \log s(n))$ -空间有界的图灵机。然后,我们引入新的$O(\mathrm{polylog}(n))$期望时间协议军政府/领导人选举和通用广播正确的概率高,近似和精确的人口规模计数正确的概率为1。最后,我们表明,权力的约束消息大小协议的主要约束是内部状态的大小:与无界的内部状态,任何可计算的功能可以计算的概率为1的限制由一个协议,只使用$\textit{1-bit}$消息。

英文摘要:

The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of $\textit{message complexity}$ for population protocols, where the state of an agent is divided into an externally-visible $\textit{message}$ and an internal component, where only the message can be observed by the other agent in an interaction. We consider the case of $O(1)$ message complexity. When time is unrestricted, we obtain an exact characterization of the stably computable predicates based on the number of internal states $s(n)$: If $s(n) = o(n)$ then the protocol computes semilinear predicates (unlike the original model, which can compute non-semilinear predicates with $s(n) = O(\log n)$), and otherwise it computes a predicate decidable by a nondeterministic $O(n \log s(n))$-space-bounded Turing machine. We then introduce novel $O(\mathrm{polylog}(n))$ expected time protocols for junta/leader election and general purpose broadcast correct with high probability, and approximate and exact population size counting correct with probability 1. Finally, we show that the main constraint on the power of bounded-message-size protocols is the size of the internal states: with unbounded internal states, any computable function can be computed with probability 1 in the limit by a protocol that uses only $\textit{1-bit}$ messages.

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

↑