Regularization-based solution of the PageRank problem for large matrices

DOI10.1134/S0005117912110094MaRDI QIDQ2393054zbMATH OpenOpenAlexFDO

Authors A. A. Tremba, Boris T. Polyak

Publication date 7 August 2013

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117912110094

zbMATH Keywords

column-stochastic matrixpagerank of web pagesregularization-based solution

Mathematics Subject Classification ID

Large-scale systems (93A15) Eigenvalue problems (93B60) Stochastic systems in control theory (general) (93E03)

Recommendations

• About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
• Extrapolation methods for PageRank computations
• Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• PageRank problem, survey and future research directions

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 3200675 (Why is no real title available?)
• Distribution of PageRank Mass Among Principle Components of the Web
• Google's PageRank and beyond. The science of search engine rankings
• Matrix Analysis
• The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
• The projection method for reaching consensus and the regularized power limit of a stochastic matrix

Cited in

(11)

• Models of latent consensus
• Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
• Saddle point mirror descent algorithm for the robust PageRank problem
• Deterministic coresets for stochastic matrices with applications to scalable sparse PageRank
• On efficient randomized algorithms for finding the PageRank vector
• Extended separating plane algorithm and NSO-solutions of PageRank problem
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
• On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
• Efficient numerical methods to solve sparse linear equations with application to PageRank
• How to make the Perron eigenvector simple

Describes a project that uses

Uses Software

• WebGraph

This page was built for publication: Regularization-based solution of the PageRank problem for large matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393054)