The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
From MaRDI portal
Publication:736033
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
Cites work
- Google's PageRank and beyond. The science of search engine rankings
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
- Smooth minimization of non-smooth functions
- Variational Analysis
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)