We review methods for the approximate computation of PageRank. Standard methods are based on the eigenvector and linear system characterizations. Our starting point are recent methods based on series representation whose coefficients are damping functions, for example Linear Rank, HyperRank and TotalRank, etc. We propose a multidamping framework for interpreting PageRank and these methods. Multidamping is based on some new useful properties of Google type matrices. The approach can be generalized and could help in the exploration of new approximations for list-based ranking. This is joint work with Georgios Kollias and is supported by a Pythagoras-EPEAEK-II grant.
@InProceedings{kollias_et_al:DagSemProc.07071.13, author = {Kollias, Giorgios and Gallopoulos, Efstratios}, title = {{Multidamping simulation framework for link-based ranking}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.13}, URN = {urn:nbn:de:0030-drops-10606}, doi = {10.4230/DagSemProc.07071.13}, annote = {Keywords: PageRank, Google, power method, eigenvalues, teleportation, list-based ranking, TotalRank} }
Feedback for Dagstuhl Publishing