Convergence Of The Fixed-Point Iteration For Multilinear Pagerank

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 is an element of(12,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 is an element of(0,1).