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 ...
Fertilization strategies as a tool to modify the organoleptic properties of raspberry (Rubus idaeus L.) fruits Valentinuzzi F; Pii Y; Mimmo T; Savini G; Curzel S; Cesco S (ELSEVIER SCIENCE BV, 2018)Raspberry cultivation is increasing all over the world, being these fruits highly appreciated not only for their taste but also for their high content in bioactive compounds. However, the short shelf-life of these fruits ...
Cohen F; Fedele A; Panteghini P (2016)In this article, we study the effects of corporate taxation on credit market equilibria in presence of asymmetric information. We develop a screening model that accounts for the following five facts: the existence of a tax ...