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

具有多种意见的3-Majority和2-Choices

3-Majority and 2-Choices with Many Opinions

Nobutaka Shimizu, Takeharu Shiraga

AI总结:

本文针对3-Majority和2-Choices同步共识动力学,在任意意见数量下首次证明了近乎最优的共识时间上界,分别为$\widetildeΘ(\min\{k,\sqrt{n}\})$和$\widetildeΘ(k)$轮。

摘要:

我们针对著名的同步共识动力学,特别是3-Majority和2-Choices,在任意数量意见的情况下,首次给出了近乎最优的共识时间界限。在同步共识动力学中,我们考虑一个带有自环的n顶点完全图,其中每个顶点持有{1,…,k}中的一个意见。在每个离散时间轮次中,所有顶点根据给定协议同时更新其意见。目标是达成共识,即所有顶点支持同一意见。在3-Majority中,每个顶点有放回地随机选择三个邻居,并将其意见更新为多数意见,平局时随机打破。在2-Choices中,每个顶点有放回地随机选择两个邻居。如果被选中的顶点持有相同意见,则该顶点采纳该意见;否则,它在该轮保留当前意见。改进了一系列工作[Becchetti et al., SPAA'14]、[Becchetti et al., SODA'16]、[Berenbrink et al., PODC'17]、[Ghaffari and Lengler, PODC'18],我们证明,对于每个2≤k≤n,3-Majority(相应地,2-Choices)以高概率在$\widetildeΘ(\min\{k,\sqrt{n}\})$(相应地,$\widetildeΘ(k)$)轮内达成共识。在此工作之前,3-Majority共识时间的已知最佳上界在k≪n^{1/3}时为$\widetilde{O}(k)$,否则为$\widetilde{O}(n^{2/3})$;对于2-Choices,共识时间在k≪$\sqrt{n}$时已知为$\widetilde{O}(k)$。

英文摘要:

We present the first nearly-optimal bounds on the consensus time for the well-known synchronous consensus dynamics, specifically 3-Majority and 2-Choices, for an arbitrary number of opinions. In synchronous consensus dynamics, we consider an $n$-vertex complete graph with self-loops, where each vertex holds an opinion from $\{1,\dots,k\}$. At each discrete-time round, all vertices update their opinions simultaneously according to a given protocol. The goal is to reach a consensus, where all vertices support the same opinion. In 3-Majority, each vertex chooses three random neighbors with replacement and updates its opinion to match the majority, with ties broken randomly. In 2-Choices, each vertex chooses two random neighbors with replacement. If the selected vertices hold the same opinion, the vertex adopts that opinion. Otherwise, it retains its current opinion for that round. Improving upon a line of work [Becchetti et al., SPAA'14], [Becchetti et al., SODA'16], [Berenbrink et al., PODC'17], [Ghaffari and Lengler, PODC'18], we prove that, for every $2\le k \le n$, 3-Majority (resp.\ 2-Choices) reaches consensus within $\widetildeΘ(\min\{k,\sqrt{n}\})$ (resp.\ $\widetildeΘ(k)$) rounds with high probability. Prior to this work, the best known upper bound on the consensus time of 3-Majority was $\widetilde{O}(k)$ if $k \ll n^{1/3}$ and $\widetilde{O}(n^{2/3})$ otherwise, and for 2-Choices, the consensus time was known to be $\widetilde{O}(k)$ for $k\ll \sqrt{n}$.

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

↑