Show simple item record

dc.contributor.authorShen ZL
dc.contributor.authorHuang TZ
dc.contributor.authorCarpentieri B
dc.contributor.authorGu XM
dc.contributor.authorWen C
dc.date.accessioned2018-05-24T12:28:39Z
dc.date.available2018-05-24T12:28:39Z
dc.date.issued2017
dc.identifier.issn0096-3003
dc.identifier.urihttp://dx.doi.org/10.1016/j.amc.2016.10.031
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0096300316306385
dc.identifier.urihttp://hdl.handle.net/10863/4731
dc.description.abstractIn Web link structures, similar link distributions often occur, especially for pages from same hosts. For PageRank problems, similar in-link distributions of pages result in similar row patterns of the transition matrix. We demonstrate that common row patterns in the transition matrix determine identical sub-rows. Thus the identical sub-rows with a large proportion of nonzeros can be eliminated to decrease the density of PageRank problems. We propose an elimination strategy that exploits such identical sub-rows and generates an elimination operator for transferring the problem to an equivalent but more sparse problem. Numerical experiments are reported to illustrate the effectiveness of this strategy for decreasing the computational cost of solving PageRank problems. © 2016 Elsevier Inc.en_US
dc.language.isoenen_US
dc.rights
dc.subjectPageRanken_US
dc.subjectElimination strategyen_US
dc.subjectRow patternsen_US
dc.subjectSparsityen_US
dc.subjectSpectral distribution Iterative methodsen_US
dc.titleAn efficient elimination strategy for solving PageRank problemsen_US
dc.typeArticleen_US
dc.date.updated2018-05-15T12:34:38Z
dc.language.isiEN-GB
dc.journal.titleApplied Mathematics and Computation
dc.description.fulltextreserveden_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record