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

通信不可靠的随机Gossip算法

Randomized Gossip Algorithm with Unreliable Communication

Guodong Shi, Mikael Johansson, Karl Henrik Johansson

摘要:

本文研究了一种不可靠通信下的异步随机流言算法。在每个实例中,选择两个节点以满足给定的概率。当节点相遇时,建立两个不可靠的通信链路,每个方向上的通信以随时间变化的概率成功。它表明,两个特别有趣的情况下,这些通信过程是完全依赖或独立的。给出了保证几乎必然一致或$ε$ -一致的成功概率序列的充要条件。当通信完全依赖时,需要弱连接,而当通信独立时,需要双连接。此外,它被证明,与奇数个节点,平均保持轮流从几乎永远(概率为1的所有初始条件)完全相关的通信,几乎从来没有(概率为零的几乎所有初始条件)的独立情况。这种平均保持属性不适用于一般数量的节点。这些结果表明,在随机八卦算法的节点相互作用的基本作用。

英文摘要:

In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are established with communication in each direction succeeding with a time-varying probability. It is shown that two particularly interesting cases arise when these communication processes are either perfectly dependent or independent. Necessary and sufficient conditions on the success probability sequence are proposed to ensure almost sure consensus or $ε$-consensus. Weak connectivity is required when the communication is perfectly dependent, while double connectivity is required when the communication is independent. Moreover, it is proven that with odd number of nodes, average preserving turns from almost forever (with probability one for all initial conditions) for perfectly dependent communication, to almost never (with probability zero for almost all initial conditions) for the independent case. This average preserving property does not hold true for general number of nodes. These results indicate the fundamental role the node interactions have in randomized gossip algorithms.

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

↑