arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.09798cs.DScs.DCmath.DS
收藏

基于突发信号的信息传播通用协议

Universal Protocols for Information Dissemination Using Emergent Signals

Bartlomiej Dudek, Adrian Kosowski

摘要:

我们认为人口的$n$代理,相互沟通,在一个分散的方式,通过随机成对的相互作用。群体中的一个或多个代理可以充当权威的信息源,其余代理的目标是从这些源代理获得信息或关于这些源代理的信息。我们研究两个基本任务:广播,其中的代理是学习的比特状态的权威来源,这是目前在人口中,和源检测,其中的代理被要求决定,如果至少有一个源代理是目前在人口或没有。我们专注于设计协议,满足两个自然条件:(1)普遍性,即,独立于种群大小,以及(2)在重新配置之后快速收敛到正确的全局状态,例如源代理的状态的改变。我们的主要积极结果是表明,这两个约束条件都可以满足。对于广播问题和源检测问题,我们获得了收敛时间为$O(\log^2 n)$轮的解,w.h.p.,从任何初始配置。广播的解决方案是精确的,这意味着所有的代理人到达由源广播的状态,而源检测的解决方案承认人口的$\varepsilon$部分的单侧错误(这是不可避免的这个问题)。这两个协议都很容易在实践中实现,并有一个紧凑的formulation.Our协议利用自组织振荡动力学的属性。在硬度方面,我们的主要结构的见解是证明,任何协议,满足约束的普遍性和快速收敛后重新配置必须显示一种形式的非平稳行为(其中振荡动力学是一个例子)。我们还观察到,该协议的振荡行为的周期性,当存在时,必须依赖于人口中存在的源代理的数量$^\\# X$。例如,我们的协议固有地依赖于通过群体的信号的出现,其周期对于大多数起始配置是$Θ(\log \frac{n}{^\\# X})$轮。具有可调频率的时钟的设计可能是独立的兴趣,特别是在建模生物网络。

英文摘要:

We consider a population of $n$ agents which communicate with each other in a decentralized manner, through random pairwise interactions. One or more agents in the population may act as authoritative sources of information, and the objective of the remaining agents is to obtain information from or about these source agents. We study two basic tasks: broadcasting, in which the agents are to learn the bit-state of an authoritative source which is present in the population, and source detection, in which the agents are required to decide if at least one source agent is present in the population or not.We focus on designing protocols which meet two natural conditions: (1) universality, i.e., independence of population size, and (2) rapid convergence to a correct global state after a reconfiguration, such as a change in the state of a source agent. Our main positive result is to show that both of these constraints can be met. For both the broadcasting problem and the source detection problem, we obtain solutions with a convergence time of $O(\log^2 n)$ rounds, w.h.p., from any starting configuration. The solution to broadcasting is exact, which means that all agents reach the state broadcast by the source, while the solution to source detection admits one-sided error on a $\varepsilon$-fraction of the population (which is unavoidable for this problem). Both protocols are easy to implement in practice and have a compact formulation.Our protocols exploit the properties of self-organizing oscillatory dynamics. On the hardness side, our main structural insight is to prove that any protocol which meets the constraints of universality and of rapid convergence after reconfiguration must display a form of non-stationary behavior (of which oscillatory dynamics are an example). We also observe that the periodicity of the oscillatory behavior of the protocol, when present, must necessarily depend on the number $^\\# X$ of source agents present in the population. For instance, our protocols inherently rely on the emergence of a signal passing through the population, whose period is $Θ(\log \frac{n}{^\\# X})$ rounds for most starting configurations. The design of clocks with tunable frequency may be of independent interest, notably in modeling biological networks.

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

↑