arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.09515cs.DS
收藏

稀疏分布网络的局部敏感表示方法

Representations of Sparse Distributed Networks: A Locality-Sensitive Approach

Haim Kaplan, Shay Solomon

摘要:

1999年,Brodal和Fagerberg(BF)给出了一个保持动态一致稀疏图的低出度定向的算法。具体地说,对于$n$ -顶点上的动态图,荫度始终由$α$限定,BF算法支持在$O(\log n)$摊销更新时间内的边更新,同时保持图中由$O(α)$限定的最大出度。这样的方向提供了一个基本的数据结构,均匀稀疏图,发现应用程序的动态图算法过多。BF算法的一个显著弱点是在边插入之后,最大出度可能出现\emph{temporary}爆破。虽然BF最终将所有的outdegrees减少到$O(α)$,但在分布式系统中作为重要质量度量的顶点处的本地存储器使用不能被限制。我们展示了如何修改BF算法,以保证所有顶点的出度是有界的$O(α)$在任何时候,而不损害其任何其他属性,并提出了一个有效的分布式实现的修改后的算法。这提供了分布式网络的\emph{first}表示,其中所有顶点处的本地内存使用由荫度(本质上是denatrium子图的平均度)而不是最大度来限制。对于没有本地内存约束的设置,我们将临时的outdegree blowup发挥到极致,并允许永久的outdegree blowup。这使我们能够解决BF算法的第二个显著弱点--其固有的\emph{global}性质:边$(u,v)$的插入可能会触发远离$u$和$v$的边的方向的变化。我们提出了一种替代的\emph{local}计划,它不保证任何出度的顶点上的限制,但只是作为有效的BF计划的各种应用。

英文摘要:

In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on $n$-vertices, with arboricity bounded by $α$ at all times, the BF algorithm supports edge updates in $O(\log n)$ amortized update time, while keeping the maximum outdegree in the graph bounded by $O(α)$. Such an orientation provides a basic data structure for uniformly sparse graphs, which found applications to a plethora of dynamic graph algorithms. A significant weakness of the BF algorithm is the possible \emph{temporary} blowup of the maximum outdegree, following edge insertions. Although BF eventually reduces all outdegrees to $O(α)$, local memory usage at the vertices, which is an important quality measure in distributed systems, cannot be bounded. We show how to modify the BF algorithm to guarantee that the outdegrees of all vertices are bounded by $O(α)$ at all times, without hurting any of its other properties, and present an efficient distributed implementation of the modified algorithm. This provides the \emph{first} representation of distributed networks in which the local memory usage at all vertices is bounded by the arboricity (which is essentially the average degree of the densest subgraph) rather than the maximum degree. For settings where there are no local memory constraints, we take the temporary outdegree blowup to the extreme and allow a permanent outdegree blowup. This allows us to address the second significant weakness of the BF algorithm -- its inherently \emph{global} nature: An insertion of an edge $(u,v)$ may trigger changes in the orientations of edges that are far away from $u$ and $v$. We suggest an alternative \emph{local} scheme, which does not guarantee any outdegree bound on the vertices, yet is just as efficient as the BF scheme for various applications.

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

↑