Regularization-based solution of the PageRank problem for large matrices

Authors:
B. T. Polyak;A. A. Tremba
Affiliations:
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2012

Citing 15
Cited 0

Matrix analysis

Matrix analysis
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Scaling personalized web search

WWW '03 Proceedings of the 12th international conference on World Wide Web
The webgraph framework I: compression techniques

Proceedings of the 13th international conference on World Wide Web
TruRank: taking PageRank to the limit

WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Google's PageRank and Beyond: The Science of Search Engine Rankings

Google's PageRank and Beyond: The Science of Search Engine Rankings
The $25,000,000,000 Eigenvector: The Linear Algebra behind Google

SIAM Review
A large time-aware web graph

ACM SIGIR Forum
PageRank: Functional dependencies

ACM Transactions on Information Systems (TOIS)
Tracking the random surfer: empirically measured teleportation parameters in PageRank

Proceedings of the 19th international conference on World wide web
Distribution of PageRank mass among principle components of the web

WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
PageRank: standing on the shoulders of giants

Communications of the ACM
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks

Proceedings of the 20th international conference on World wide web
The projection method for reaching consensus and the regularized power limit of a stochastic matrix

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a column-stochastic matrix, consideration was given to determination of the eigenvector which corresponds to the unit eigenvalue. Such problems are encountered in many applications,--in particular, at ranking the web pages (PageRank). Since the PageRank problem is of special interest for larger matrices, the emphasis was made on the power method for direct iterative calculation of the eigenvector. Several variants of regularization of the power methods were compared, and their relations were considered. The distinctions of their realizations were given.