arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0612012cs.MAcs.ITmath.IT
收藏

基于仿射组合的几何随机图的地理流言

Geographic Gossip on Geometric Random Graphs via Affine Combinations

Hariharan Narayanan

摘要:

近年来,大量的工作致力于几何随机图中gossip算法的开发和分析。在最近引入的称为“地理流言”的模型中,每个节点都知道自己的位置,但没有进一步的信息。传统上,gossip协议总是使用凸线性组合来实现平均。我们开发了一个新的协议,地理八卦,其中反直觉,我们使用{ \it非凸仿射组合}作为更新,除了凸组合,以加速平均过程。我们的算法所使用的传输的数量对传感器的数量$n$的依赖性是$n \exp(O(\log \log n)^2) = n^{1 + o(1)}$。对于之前的算法,此依赖性为$\tilde{O}(n^{1.5})$。我们的算法的指数1+ o(1)是渐近最优的。我们的算法涉及到一个层次结构的$\log \log n$深度和不完全分散。然而,一个传感器对另一个传感器的控制程度仅限于打开或关闭另一个传感器。

英文摘要:

In recent times, a considerable amount of work has been devoted to the development and analysis of gossip algorithms in Geometric Random Graphs. In a recently introduced model termed "Geographic Gossip," each node is aware of its position but possesses no further information. Traditionally, gossip protocols have always used convex linear combinations to achieve averaging. We develop a new protocol for Geographic Gossip, in which counter-intuitively, we use {\it non-convex affine combinations} as updates in addition to convex combinations to accelerate the averaging process. The dependence of the number of transmissions used by our algorithm on the number of sensors $n$ is $n \exp(O(\log \log n)^2) = n^{1 + o(1)}$. For the previous algorithm, this dependence was $\tilde{O}(n^{1.5})$. The exponent 1+ o(1) of our algorithm is asymptotically optimal. Our algorithm involves a hierarchical structure of $\log \log n$ depth and is not completely decentralized. However, the extent of control exercised by a sensor on another is restricted to switching the other on or off.

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

↑