异步 DeGroot 动力学
The Asynchronous DeGroot Dynamics
AI总结:
该论文分析异步DeGroot动力学,证明在无向图和欧拉有向图中达到ε-共识的期望时间为多项式,在均匀有界度和独立同分布初始意见下为多对数,并给出共识方差估计,推广至非可逆马尔可夫链和无限图。
摘要:
我们分析了 DeGroot 动力学的异步版本:在一个具有 $n$ 个节点的连通图 $G$ 中,每个节点在 $[0,1]$ 中有一个初始意见和一个独立的泊松时钟。当节点 $v$ 的时钟响起时,$v$ 处的意见被替换为其邻居的平均意见。众所周知,这些意见会收敛到一个共识。我们证明了在无向图和欧拉有向图中,达到 $\varepsilon$-共识的期望时间 $\mathbb E(τ_\varepsilon)$ 是 poly$(n)$,但对于某些有界度的有向图,它是指数级的。\n 我们的主要结果是,在无向图和欧拉有向图中,如果度数是均匀有界的且初始意见是独立同分布的,那么对于每个固定的 $\varepsilon>0$,$\mathbb E(τ_\varepsilon)=\text{polylog}(n)$。我们给出了极限共识意见方差的尖锐估计,该方差衡量了聚合信息的能力(“群体智慧”)。我们还证明了到非可逆马尔可夫链和无限图的推广。关于碎片过程和耦合随机游走的独立有趣的新结果对我们的分析至关重要。
英文摘要:
We analyze the asynchronous version of the DeGroot dynamics: In a connected graph $G$ with $n$ nodes, each node has an initial opinion in $[0,1]$ and an independent Poisson clock. When a clock at a node $v$ rings, the opinion at $v$ is replaced by the average opinion of its neighbors. It is well known that the opinions converge to a consensus. We show that the expected time $\mathbb E(τ_\varepsilon)$ to reach $\varepsilon$-consensus is poly$(n)$ in undirected graphs and in Eulerian digraphs, but for some digraphs of bounded degree it is exponential. Our main result is that in undirected graphs and Eulerian digraphs, if the degrees are uniformly bounded and the initial opinions are i.i.d., then $\mathbb E(τ_\varepsilon)=\text{polylog}(n)$ for every fixed $\varepsilon>0$. We give sharp estimates for the variance of the limiting consensus opinion, which measures the ability to aggregate information (``wisdom of the crowd''). We also prove generalizations to non-reversible Markov chains and infinite graphs. New results of independent interest on fragmentation processes and coupled random walks are crucial to our analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。