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

动态图上的近似个性化PageRank

Approximate Personalized PageRank on Dynamic Graphs

Hongyang Zhang, Peter Lofgren, Ashish Goel

摘要:

我们提出并分析了两种算法保持近似个性化PageRank(PPR)向量的动态图,边被添加或删除。我们的算法是自然的动态版本的两个已知的局部变化的权力迭代。一个是正向推,它从源节点沿着边向前传播概率质量,而另一个是反向推,它从目标节点沿着边向后传播局部变化。在这两种变体中,我们保持两个向量之间的不变量,当边缘更新时,我们的算法首先修改向量以恢复不变量,然后执行任何需要的局部推操作以恢复准确性。对于反向推,我们证明了,对于任意有向图的随机边模型,或对于任意无向图,给定一个均匀随机的目标节点$t$,成本保持一个PPR向量$t$的附加错误$\varepsilon$作为$k$边缘更新是$O(k + \bar{d} / \varepsilon)$,其中$\bar{d}$是图的平均度。这是每次更新的$O(1)$工作量,加上在静态图上计算一次反向向量的成本。对于前推,我们表明,在任意的无向图,给定一个均匀随机的开始节点$s$,从$s$的度归一化误差$\varepsilon$作为$k$边缘更新维护PPR向量的成本是$O(k + 1 / \varepsilon)$,这再次是每次更新$O(1)$加上一个静态图上计算PPR向量的成本。

英文摘要:

We propose and analyze two algorithms for maintaining approximate Personalized PageRank (PPR) vectors on a dynamic graph, where edges are added or deleted. Our algorithms are natural dynamic versions of two known local variations of power iteration. One, Forward Push, propagates probability mass forwards along edges from a source node, while the other, Reverse Push, propagates local changes backwards along edges from a target. In both variations, we maintain an invariant between two vectors, and when an edge is updated, our algorithm first modifies the vectors to restore the invariant, then performs any needed local push operations to restore accuracy. For Reverse Push, we prove that for an arbitrary directed graph in a random edge model, or for an arbitrary undirected graph, given a uniformly random target node $t$, the cost to maintain a PPR vector to $t$ of additive error $\varepsilon$ as $k$ edges are updated is $O(k + \bar{d} / \varepsilon)$, where $\bar{d}$ is the average degree of the graph. This is $O(1)$ work per update, plus the cost of computing a reverse vector once on a static graph. For Forward Push, we show that on an arbitrary undirected graph, given a uniformly random start node $s$, the cost to maintain a PPR vector from $s$ of degree-normalized error $\varepsilon$ as $k$ edges are updated is $O(k + 1 / \varepsilon)$, which is again $O(1)$ per update plus the cost of computing a PPR vector once on a static graph.

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

↑