arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.09524cs.DMcs.DCmath.PR
收藏

稠密图上的三选一投票

Best-of-Three Voting on Dense Graphs

Nan Kang, Nicolas Rivera

摘要:

给定一个由$n$顶点组成的图$G$,其中每个顶点最初都附加了红色或蓝色的意见。我们研究了一个随机过程,称为三选一投票。在这个过程中,在每一个时间步,每个顶点随机选择三个邻居,并采用多数颜色。我们研究了一类具有最小度$d = n^α$ \,的图的这一过程,其中$α= Ω\left( (\log \log n)^{-1} \right)$ .我们证明,如果最初每个顶点是红色的概率大于$1/2+δ$,否则,在$δ\geq (\log d)^{-C}$的一些$C>0$,然后与高概率,这种动态达到一个最终状态,所有顶点都是红色的$O\left( \log \log n\right) + O\left( \log \left( δ^{-1} \right) \right)$步骤。

英文摘要:

Given a graph $G$ of $n$ vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In this process, at each time step, every vertex chooses three neighbours at random and adopts the majority colour. We study this process for a class of graphs with minimum degree $d = n^α$\,, where $α= Ω\left( (\log \log n)^{-1} \right)$. We prove that if initially each vertex is red with probability greater than $1/2+δ$, and blue otherwise, where $δ\geq (\log d)^{-C}$ for some $C>0$, then with high probability this dynamic reaches a final state where all vertices are red within $O\left( \log \log n\right) + O\left( \log \left( δ^{-1} \right) \right)$ steps.

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

↑