Zeyuan Allen-Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab Mirrokni, Lorenzo Orecchia
TL;DR本文针对给定 n 个节点和 d 个邻居的无向图,提出了一种分布式的算法,使用随机翻转来改进图的连通性以获得新的拓展图,且经研究表明可以在 O(n ^ 2 d ^ 2 log n)的步骤内实现高概率有效。
Abstract
Designing distributed and scalable algorithms to improve network connectivity
is a central topic in peer-to-peer networks. In this paper we focus on the
following well-known problem: given an $n$-node $d$-regular