Fixed-point iteration is a popular method for the multilinear PageRank problem. In [B. Meini, F. Poloni, Perron-based algorithms for the multilinear PageRank, Numer. Linear Algebra Appl., 25: e2177, 2018], a theorem was proved to determine the behavior of the fixed-point iteration as the parameter $\alpha \in (\frac{1}{2},1)$. In this work, we point out that this theorem is incomplete, and revisit the convergence of the fixed-point iteration for multilinear PageRank as $\alpha \in (0,1)$.

中文翻译：

---

多线性 PageRank 的定点迭代收敛

定点迭代是多线性 PageRank 问题的流行方法。在 [ B. Meini, F. Poloni，基于 Perron 的多线性 PageRank 算法，Numer。Linear Algebra Appl., 25: e2177, 2018]，证明了一个定理来确定定点迭代的行为作为参数$\alpha \in (\frac{1}{2},1)$. 在这项工作中，我们指出该定理是不完整的，并重新审视多线性 PageRank 的定点迭代的收敛性为$\alpha \in (0,1)$.