Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to Pagerank computation

Abstract

Let $S$ be a column stochastic matrix with at least one full row. Then $S$ describes a Pagerank-like random walk since the computation of the Perron vector $x$ of $S$ can be tackled by solving a suitable M-matrix linear system $Mx = y$, where $M = I − \tau A$, $A$ is a column stochastic matrix and $\tau$ is a positive coefficient smaller than one. The Pagerank centrality index on graphs is a relevant example where these two formulations appear. Previous investigations have shown that the Euler- Richardson (ER) method can be considered in order to approach the Pagerank computation problem by means of preconditioning strategies. In this work, it is observed indeed that the classical power method can be embedded into the ER scheme, through a suitable simple preconditioner. Therefore, a new preconditioner is proposed based on fast Householder transformations and the concept of low complexity weakly stochastic algebras, which gives rise to an effective alternative to the power method for large-scale sparse problems. Detailed mathematical reasonings for this choice are given and the convergence properties discussed. Numerical tests performed on real-world datasets are presented, showing the advantages given by the use of the proposed Householder-Richardson method.

Please cite this work as:

@article{cipolla2017euler,
  title={Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to Pagerank computation},
  author={Cipolla, Stefano and Di Fiore, Carmine and Tudisco, Francesco},
  journal={Electronic Journal of Linear Algebra},
  volume={32},
  pages={254--272},
  year={2017}
}

Keywords: Matrix algebras Preconditioning Nonnegative matrices Pagerank