谱排序的推式算法
The Push Algorithm for Spectral Ranking
摘要：
推算法首先由Jeh和Widom在个性化PageRank计算的背景下提出（尽管“推算法”这个名字实际上是由Andersen，Chung和Lang在随后的论文中使用的）。在本说明中，我们描述了算法的一般性水平，使计算的频谱排名的任何非负矩阵可能。实际上，这篇笔记的主要贡献是描述非常简单（几乎是微不足道的），它只需要一些初等线性代数计算。一路上，我们给出了新的精确的方法来估计算法的收敛性，并描述了现有文献的一些贡献，这些文献在我们的框架中重新构建时再次被证明是即时的。
英文摘要：
The push algorithm was proposed first by Jeh and Widom in the context of personalized PageRank computations (albeit the name "push algorithm" was actually used by Andersen, Chung and Lang in a subsequent paper). In this note we describe the algorithm at a level of generality that make the computation of the spectral ranking of any nonnegative matrix possible. Actually, the main contribution of this note is that the description is very simple (almost trivial), and it requires only a few elementary linear-algebra computations. Along the way, we give new precise ways of estimating the convergence of the algorithm, and describe some of the contribution of the existing literature, which again turn out to be immediate when recast in our framework.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
