多元共识的简单动力学
Simple Dynamics for Plurality Consensus
摘要:
我们研究了一个\emph{Plurality-Consensus}过程中,每个$n$匿名代理的通信网络最初支持的意见(颜色从有限集$[k]$)。然后,在每一轮(同步)中,每个智能体都可以根据其邻居的随机样本当前持有的意见修改其颜色。假设初始颜色配置对于固定的多个颜色表现出足够大的\emph{bias} $s$,即,支持多个颜色的节点的数量超过支持任何其它颜色的节点的数量$s$附加节点。目标是使过程收敛到其中所有节点支持初始多个的\emph{stable}配置。我们考虑一个基本模型,其中网络是一个集团和更新规则(这里称为\emph{3-majority dynamics})的过程如下:每个代理看三个随机邻居的颜色,然后应用多数规则(打破领带均匀)。我们证明,只要$s \geqslant c \sqrt{ \min\{ 2k, (n/\log n)^{1/3} \}\, n \log n}$,该过程就以很高的概率在时间$\mathcal{O}( \min\{ k, (n/\log n)^{1/3} \} \, \log n )$上收敛。然后我们证明我们的上界是紧的,只要$k \leqslant (n/\log n)^{1/4}$。这一事实意味着多元共有过程和Doerr等人在[ACM SPAA'11]中研究的\emph{median}过程之间存在指数时间差。一个自然的问题是,查看更多(超过三个)随机邻居是否可以显着加快这个过程。我们提供了一个否定的回答这个问题:特别是,我们表明,样本的polylogarithmic大小可以加快这个过程中的一个polylogarithmic因素。
英文摘要:
We study a \emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise his color according to the opinions currently held by a random sample of his neighbors. It is assumed that the initial color configuration exhibits a sufficiently large \emph{bias} $s$ towards a fixed plurality color, that is, the number of nodes supporting the plurality color exceeds the number of nodes supporting any other color by $s$ additional nodes. The goal is having the process to converge to the \emph{stable} configuration in which all nodes support the initial plurality. We consider a basic model in which the network is a clique and the update rule (called here the \emph{3-majority dynamics}) of the process is the following: each agent looks at the colors of three random neighbors and then applies the majority rule (breaking ties uniformly). We prove that the process converges in time $\mathcal{O}( \min\{ k, (n/\log n)^{1/3} \} \, \log n )$ with high probability, provided that $s \geqslant c \sqrt{ \min\{ 2k, (n/\log n)^{1/3} \}\, n \log n}$. We then prove that our upper bound above is tight as long as $k \leqslant (n/\log n)^{1/4}$. This fact implies an exponential time-gap between the plurality-consensus process and the \emph{median} process studied by Doerr et al. in [ACM SPAA'11]. A natural question is whether looking at more (than three) random neighbors can significantly speed up the process. We provide a negative answer to this question: In particular, we show that samples of polylogarithmic size can speed up the process by a polylogarithmic factor only.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。