About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
From MaRDI portal
(Redirected from Publication:4636840)
Recommendations
- About the power law of the PageRank vector component distribution. II: The Buckley-Osthus model, verification of the power law for this model, and setup of real search engines
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- A variant of the Power-Arnoldi algorithm for computing PageRank
- On efficient randomized algorithms for finding the PageRank vector
- A Power–Arnoldi algorithm for computing PageRank
- A new extrapolation method for PageRank computations
- On some analytical properties of a general PageRank algorithm
- Distribution of PageRank Mass Among Principle Components of the Web
- Rational extrapolation for the PageRank vector
- Extrapolation methods for PageRank computations
Cited in
(10)- An accelerated directional derivative method for smooth stochastic convex optimization
- On the independence number and the chromatic number of generalized preferential attachment models
- Regularization-based solution of the PageRank problem for large matrices
- Symbolic dynamics methods and simulation of Internet search
- The mathematics of Google: the PageRank algorithm
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- PageRank problem, survey and future research directions
- About the power law of the PageRank vector component distribution. II: The Buckley-Osthus model, verification of the power law for this model, and setup of real search engines
- Accelerating PageRank computations
- The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
This page was built for publication: About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636840)