A modified Newton method for multilinear PageRank
Provides a theoretical guarantee for a Newton-like method in multilinear PageRank, but the contribution is incremental as it extends existing methods to a specific parameter regime.
The paper develops convergence theory for a modified Newton method to solve multilinear PageRank, showing monotonic convergence to the nonnegative solution in a specific parameter regime, with numerical results confirming effectiveness.
When studying the multilinear PageRank problem, a system of polynomial equations needs to be solved. In this paper, we develop convergence theory for a modified Newton method in a particular parameter regime. The sequence of vectors produced by Newton-like method is monotonically increasing and converges to the nonnegative solution. Numerical results illustrate the effectiveness of this procedure.