扩展图上的拟多数函数投票
Quasi-majority Functional Voting on Expander Graphs
摘要:
考虑一个分布式图,其中每个顶点持有两个不同观点之一。在本文中,我们感兴趣的同步投票过程中,每个顶点更新其意见,根据一个预定义的共同的本地更新规则。例如,每个顶点采用1)它自己和两个随机选择的邻居在两个最好的或2)三个随机选择的邻居在三个最好的多数意见。以前的作品深入研究了具体的规则,包括两局两胜和三局两胜。在本文中,我们推广和扩展以前的工作最好的两个和最好的三个扩展图,提出了一个新的模型,准多数功能投票。这个新模型包含两局两胜和三局两胜作为特例。我们表明,在扩展图具有足够大的初始偏差,任何准多数功能投票达到共识的$O(\log n)$步骤的概率很高。此外,我们表明,对于任何初始意见配置,任何准多数功能投票的扩展图具有较高的扩展(例如,Erdens-Rényi图$G(n,p)$与$p=Ω(1/\sqrt{n})$)以高概率在$O(\log n)$内达成共识。此外,我们表明,共识时间是$O(\log n/\log k)$的最佳$(2k+1)$为$k=o(n/\log n)$。
英文摘要:
Consider a distributed graph where each vertex holds one of two distinct opinions. In this paper, we are interested in synchronous voting processes where each vertex updates its opinion according to a predefined common local updating rule. For example, each vertex adopts the majority opinion among 1) itself and two randomly picked neighbors in best-of-two or 2) three randomly picked neighbors in best-of-three. Previous works intensively studied specific rules including best-of-two and best-of-three individually. In this paper, we generalize and extend previous works of best-of-two and best-of-three on expander graphs by proposing a new model, quasi-majority functional voting. This new model contains best-of-two and best-of-three as special cases. We show that, on expander graphs with sufficiently large initial bias, any quasi-majority functional voting reaches consensus within $O(\log n)$ steps with high probability. Moreover, we show that, for any initial opinion configuration, any quasi-majority functional voting on expander graphs with higher expansion (e.g., Erdős-Rényi graph $G(n,p)$ with $p=Ω(1/\sqrt{n})$) reaches consensus within $O(\log n)$ with high probability. Furthermore, we show that the consensus time is $O(\log n/\log k)$ of best-of-$(2k+1)$ for $k=o(n/\log n)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。