A Preconditioned Variant of the Refined Arnoldi Method for Computing PageRank Eigenvectors

A Preconditioned Variant of the Refined Arnoldi Method for Computing PageRank Eigenvectors

The PageRank model computes the stationary distribution of a Markov random walk on the linking structure of a network, and it uses the values within to represent the importance or centrality of each node. This model is first proposed by Google for ranking web pages, then it is widely applied as a ce...

Full description

Bibliographic Details
Main Authors: Zhao-Li Shen, Hao Yang, Bruno Carpentieri, Xian-Ming Gu, Chun Wen
Format: Article
Language:English
Published: MDPI AG 2021-07-01
Series:Symmetry
Subjects:
PageRank
Arnoldi
preconditioning
Krylov subspace methods
Online Access:https://www.mdpi.com/2073-8994/13/8/1327

Similar Items

Similar Items