Convergence of the fixed‐point iteration for multilinear PageRank
Copyright policy )Convergence of the fixed‐point iteration for multilinear PageRank
AbstractFixed‐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 . In this work, we point out that this theorem is incomplete, and revisit the convergence of the fixed‐point iteration for multilinear PageRank as .
- China University of Mining and Technology China (People's Republic of)
Numerical computation of eigenvalues and eigenvectors of matrices, PageRank, Iterative numerical methods for linear systems, multilinear PageRank, fixed-point iteration, higher-order Markov chain
Numerical computation of eigenvalues and eigenvectors of matrices, PageRank, Iterative numerical methods for linear systems, multilinear PageRank, fixed-point iteration, higher-order Markov chain
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).10 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!