arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.00482cs.DScs.DC
收藏

随机性在局部分布图算法中的应用

On the Use of Randomness in Local Distributed Graph Algorithms

Mohsen Ghaffari, Fabian Kuhn

摘要:

我们试图更好地了解随机化的局部分布图算法,探索如何使用随机性,我们可以从中获得什么:-我们首先问的问题,需要多少随机性,以获得有效的随机算法。我们证明了对于所有局部可检验的问题,其polylog $n$ -时间随机算法存在,有这样的算法,即使(I)在图的每个polylog $n$ -邻域中只有一个单独的(私有)独立随机位,(II)不同节点的随机性的(私有)位仅是polylog $n$ -wise独立的,或者(III)仅存在全局共享随机性的polylog $n$位(并且没有私有随机性)。- 第二,我们研究了我们能在多大程度上提高随机算法的错误概率。对于所有局部可检查的问题,其中polylog $n$时间随机算法存在,我们表明,有这样的算法,成功的概率$1-n^{-2^{\varepsilon(\log\log n)^2}}$和更一般的$T$轮算法,$T\geq$ polylog $n$,成功的概率$1-n^{-2^{\varepsilon\log^2T}}$。我们还表明,polylog $n$ -时间随机算法的成功概率$1-2^{-2^{\log^\varepsilon n}}$的一些$\varepsilon>0$可以去随机化的polylog $n$ -时间确定性算法。上述两个方向,减少随机量和提高成功概率,可以看作是现有的随机算法的部分去随机化。在所有上述情况下,我们还表明,我们的结果的任何显着改善将导致一个重大突破,因为它将意味着更有效的确定性分布式算法的广泛的一类问题。

英文摘要:

We attempt to better understand randomization in local distributed graph algorithms by exploring how randomness is used and what we can gain from it: - We first ask the question of how much randomness is needed to obtain efficient randomized algorithms. We show that for all locally checkable problems for which polylog $n$-time randomized algorithms exist, there are such algorithms even if either (I) there is a only a single (private) independent random bit in each polylog $n$-neighborhood of the graph, (II) the (private) bits of randomness of different nodes are only polylog $n$-wise independent, or (III) there are only polylog $n$ bits of global shared randomness (and no private randomness). - Second, we study how much we can improve the error probability of randomized algorithms. For all locally checkable problems for which polylog $n$-time randomized algorithms exist, we show that there are such algorithms that succeed with probability $1-n^{-2^{\varepsilon(\log\log n)^2}}$ and more generally $T$-round algorithms, for $T\geq$ polylog $n$, that succeed with probability $1-n^{-2^{\varepsilon\log^2T}}$. We also show that polylog $n$-time randomized algorithms with success probability $1-2^{-2^{\log^\varepsilon n}}$ for some $\varepsilon>0$ can be derandomized to polylog $n$-time deterministic algorithms. Both of the directions mentioned above, reducing the amount of randomness and improving the success probability, can be seen as partial derandomization of existing randomized algorithms. In all the above cases, we also show that any significant improvement of our results would lead to a major breakthrough, as it would imply significantly more efficient deterministic distributed algorithms for a wide class of problems.

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

↑