The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
DOI10.1134/S1064562409030338zbMATH Open1176.65042MaRDI QIDQ736033FDOQ736033
Authors: Alexander Nazin, Boris T. Polyak 
Publication date: 26 October 2009
Published in: Doklady Mathematics (Search for Journal in Brave)
Recommendations
- Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
- PageRank computation via a distributed randomized approach with lossy communication
- On efficient randomized algorithms for finding the PageRank vector
- About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
- Regularization-based solution of the PageRank problem for large matrices
convergencerandomized algorithmeigenvectorlargest eigenvaluestochastic matrixconvex stochastic optimizationmirror-descent methodPageRank problem
Probabilistic models, generic numerical methods in probability and statistics (65C20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Searching and sorting (68P10) Stochastic matrices (15B51) Applications of stochastic analysis (to PDEs, etc.) (60H30)
Cites Work
- Variational Analysis
- Smooth minimization of non-smooth functions
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Google's PageRank and beyond. The science of search engine rankings
- Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
Cited In (3)
This page was built for publication: The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736033)
