A multi-power and multi-splitting inner-outer iteration for PageRank computation

As an effective and possible method for computing PageRank problem, the inner-outer (IO) iteration has attracted wide interest in the past few years since it was first proposed by Gleich et al. (2010). In this paper, we present a variant of the IO iteration, which is based on multi-step power and mu...

Full description

Bibliographic Details
Main Authors: Pu Bing-Yuan, Wen Chun, Hu Qian-Ying
Format: Article
Language:English
Published: De Gruyter 2020-12-01
Series:Open Mathematics
Subjects:
Online Access:https://doi.org/10.1515/math-2020-0120
id doaj-62fcd9f5121d4cd1a4437f022b14221a
record_format Article
spelling doaj-62fcd9f5121d4cd1a4437f022b14221a2021-09-06T19:20:12ZengDe GruyterOpen Mathematics2391-54552020-12-011811709171810.1515/math-2020-0120math-2020-0120A multi-power and multi-splitting inner-outer iteration for PageRank computationPu Bing-Yuan0Wen Chun1Hu Qian-Ying2Department of Basic Science, Chengdu Textile College, Chengdu, 611731, ChinaSchool of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, ChinaSchool of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, ChinaAs an effective and possible method for computing PageRank problem, the inner-outer (IO) iteration has attracted wide interest in the past few years since it was first proposed by Gleich et al. (2010). In this paper, we present a variant of the IO iteration, which is based on multi-step power and multi-step splitting and is denoted by MPMIO. The description and convergence are discussed in detail. Numerical examples are given to illustrate the effectiveness of the proposed method.https://doi.org/10.1515/math-2020-0120pagerankpower methodinner-outer iterationmulti-splittingconvergence65c4065f10
collection DOAJ
language English
format Article
sources DOAJ
author Pu Bing-Yuan
Wen Chun
Hu Qian-Ying
spellingShingle Pu Bing-Yuan
Wen Chun
Hu Qian-Ying
A multi-power and multi-splitting inner-outer iteration for PageRank computation
Open Mathematics
pagerank
power method
inner-outer iteration
multi-splitting
convergence
65c40
65f10
author_facet Pu Bing-Yuan
Wen Chun
Hu Qian-Ying
author_sort Pu Bing-Yuan
title A multi-power and multi-splitting inner-outer iteration for PageRank computation
title_short A multi-power and multi-splitting inner-outer iteration for PageRank computation
title_full A multi-power and multi-splitting inner-outer iteration for PageRank computation
title_fullStr A multi-power and multi-splitting inner-outer iteration for PageRank computation
title_full_unstemmed A multi-power and multi-splitting inner-outer iteration for PageRank computation
title_sort multi-power and multi-splitting inner-outer iteration for pagerank computation
publisher De Gruyter
series Open Mathematics
issn 2391-5455
publishDate 2020-12-01
description As an effective and possible method for computing PageRank problem, the inner-outer (IO) iteration has attracted wide interest in the past few years since it was first proposed by Gleich et al. (2010). In this paper, we present a variant of the IO iteration, which is based on multi-step power and multi-step splitting and is denoted by MPMIO. The description and convergence are discussed in detail. Numerical examples are given to illustrate the effectiveness of the proposed method.
topic pagerank
power method
inner-outer iteration
multi-splitting
convergence
65c40
65f10
url https://doi.org/10.1515/math-2020-0120
work_keys_str_mv AT pubingyuan amultipowerandmultisplittinginnerouteriterationforpagerankcomputation
AT wenchun amultipowerandmultisplittinginnerouteriterationforpagerankcomputation
AT huqianying amultipowerandmultisplittinginnerouteriterationforpagerankcomputation
AT pubingyuan multipowerandmultisplittinginnerouteriterationforpagerankcomputation
AT wenchun multipowerandmultisplittinginnerouteriterationforpagerankcomputation
AT huqianying multipowerandmultisplittinginnerouteriterationforpagerankcomputation
_version_ 1717777068183257088