An efficient elimination strategy for solving PageRank problems
MetadataShow full item record
SubjectPageRank; Elimination strategy; Row patterns; Sparsity; Spectral distribution Iterative methods
In 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.
Showing items related by title, author, creator and subject.
Perego P; Hartmann F (2009)Alignment of an organization's performance measurement system with its strategy is widely advocated as a guiding principle in management control system design. Despite its importance, it is far from clear what strategic ...
Matt, DT; Franzellin, VM; Rauch, E (Carl Hanser Verlag, 2010)The success rate of new strategies, products and services can only be increased by a consequent (pre-) orientation to the future markets and respectively the stakeholder’s and the customer’s benefit. This article presents ...
Rizzi, A; Pontiroli, A; Brusetti, L; Borin, S; Sorlini, C; Abruzzese, A; Sacchi, GA; Vogel, TM; Simonet, P; Bazzicalupo, M; Nielsen, KM; Monier, JM; Daffonchio, D (American Society for Microbiology, 2008)A strategy is described that enables the in situ detection of natural transformation in Acinetobacter baylyi BD413 by the expression of a green fluorescent protein. Microscale detection of bacterial transformants growing ...