异步最大模型的收敛性质
Convergence Properties of the Asynchronous Maximum Model
AI总结:
本文研究异步最大模型的收敛性质,证明强连通有向图最终所有顶点值相同,并给出了无向图和有向图收敛时间的紧确渐近界限及更优上界。
摘要:
设 $G = (V,E)$ 为具有 $n$ 个顶点的连通有向图。将集合 $\{1,2,\dots,n\}$ 中的值分配给 $G$ 的顶点,并按以下规则更新:均匀随机选择一个顶点,并将其值更新为其邻域中值的最大值。该顶点的值可能会减小。此随机过程称为异步最大模型。重复此过程,我们证明对于强连通有向图,最终所有顶点将具有相同的值,此时称该模型已收敛。在无向情况下,期望收敛时间(当 $n\to \infty$ 时)渐近处于 $\Omega(n\log n)$ 和 $O(n^2)$ 之间,且这些界限是紧确的。我们进一步将收敛时间表征为 $O(\frac{n}{\phi}\log n)$,其中 $\phi$ 是 $G$ 的顶点扩展。这为一大类图提供了更好的上界。此外,我们证明以高概率收敛前的轮数处于 $O((\frac{n}{\phi}\log n)g(n))$,其中 $g(n)$ 满足当 $n \to \infty$ 时 $\frac{1}{g^2(n)} \to 0$。对于强连通有向图,收敛时间被证明处于 $O(nb^2 + \frac{n}{\phi'}\log n)$,其中 $b$ 是衡量有向环长度的参数,$\phi'$ 是衡量顶点扩展的参数。
英文摘要:
Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its value to the maximum of the values in its neighbourhood. The value at this vertex can potentially decrease. This random process is called the asynchronous maximum model. Repeating this process we show that for a strongly connected directed graph eventually all vertices have the same value and the model is said to have \textit{converged}. In the undirected case the expected convergence time is shown to be asymptotically (as $n\to \infty$) in $Ω(n\log n)$ and $O(n^2)$ and these bounds are tight. We further characterise the convergence time in $O(\frac{n}ϕ\log n)$ where $ϕ$ is the vertex expansion of $G$. This provides a better upper bound for a large class of graphs. Further, we show the number of rounds until convergence is in $O((\frac{n}ϕ\log n)g(n))$ with high probability, where $g(n)$ satisfies $\frac{1}{g^2(n)} \to 0$ as $n \to \infty$. For a strongly connected directed graph the convergence time is shown to be in $O(nb^2 + \frac{n}{ϕ'}\log n)$ where $b$ is a parameter measuring directed cycle length and $ϕ'$ is a parameter measuring vertex expansion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。