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

规则扩展器中的快速多数共识

Fast plurality consensus in regular expanders

Colin Cooper, Tomasz Radzik, Nicolás Rivera, Takeharu Shiraga

摘要:

拉投票是一种经典的方法,可以在分布式网络中的$n$顶点之间达成共识:每一步的每个顶点都采取随机邻居的意见。然而,这种方法有两个缺点。即使只有两个对立的意见,一个单一的意见出现所需的时间可能是缓慢的,最后的意见不一定是最初持有的多数。我们将每个步骤联系2个邻居的协议称为2样本投票协议。在双样本协议中,只有当两个采样意见相同时,顶点才会更新其意见。在有三个或更多意见的情况下,对一般扩展器的双样本投票的性能知之甚少。在本文中,我们表明,以下性能可以实现$d$ -定期扩展使用两个样本投票。我们假设存在$k \ge 3$意见,并且最大和第二大意见的初始大小分别为$A_1, A_2$。我们证明,如果$A_1 - A_2 \ge C n \max\{\sqrt{(\log n)/A_1}, λ\}$,其中$λ$是矩阵$P=Adj(G)/d$的绝对第二特征值和$C$是一个合适的常数,那么最大的意见赢得$O((n \log n)/A_1)$步骤的高概率。对于几乎所有的$d$ -正则图,我们对某个常数$c>0$有$λ=c/\sqrt{d}$.这意味着随着$d$的增加,我们可以分离出多数为$o(n)$的意见,而$d$常数需要$Θ(n)$多数。这项工作推广了Becchetti et. al(SPAA 2014)的完整图$K_n$。

英文摘要:

Pull voting is a classic method to reach consensus among $n$ vertices with differing opinions in a distributed network: each vertex at each step takes on the opinion of a random neighbour. This method, however, suffers from two drawbacks. Even if there are only two opposing opinions, the time taken for a single opinion to emerge can be slow and the final opinion is not necessarily the initially held majority. We refer to a protocol where 2 neighbours are contacted at each step as a 2-sample voting protocol. In the two-sample protocol a vertex updates its opinion only if both sampled opinions are the same. Not much was known about the performance of two-sample voting on general expanders in the case of three or more opinions. In this paper we show that the following performance can be achieved on a $d$-regular expander using two-sample voting. We suppose there are $k \ge 3$ opinions, and that the initial size of the largest and second largest opinions is $A_1, A_2$ respectively. We prove that, if $A_1 - A_2 \ge C n \max\{\sqrt{(\log n)/A_1}, λ\}$, where $λ$ is the absolute second eigenvalue of matrix $P=Adj(G)/d$ and $C$ is a suitable constant, then the largest opinion wins in $O((n \log n)/A_1)$ steps with high probability. For almost all $d$-regular graphs, we have $λ=c/\sqrt{d}$ for some constant $c>0$. This means that as $d$ increases we can separate an opinion whose majority is $o(n)$, whereas $Θ(n)$ majority is required for $d$ constant. This work generalizes the results of Becchetti et. al (SPAA 2014) for the complete graph $K_n$.

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

↑