On efficient randomized algorithms for finding the PageRank vector
From MaRDI portal
Recommendations
- The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Distributed Randomized Algorithms for the PageRank Computation
- Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
- A sublinear time algorithm for PageRank computations
- Distributed randomized algorithms for PageRank computation: recent advances
- On accelerating the PageRank computation
- The coupled iteration algorithms for computing PageRank
- A Hessenberg-type algorithm for computing PageRank problems
Cites work
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Chernoff-type bound for finite Markov chains
- Computational methods of linear algebra
- Concentration inequalities. A nonasymptotic theory of independence
- Curvature, concentration and error estimates for Markov chain Monte Carlo
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Forest matrices around the Laplacian matrix
- Google's PageRank and beyond. The science of search engine rankings
- scientific article; zbMATH DE number 3925639 (Why is no real title available?)
- scientific article; zbMATH DE number 4041131 (Why is no real title available?)
- scientific article; zbMATH DE number 3790207 (Why is no real title available?)
- scientific article; zbMATH DE number 3614066 (Why is no real title available?)
- scientific article; zbMATH DE number 2004861 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 858900 (Why is no real title available?)
- scientific article; zbMATH DE number 3275139 (Why is no real title available?)
- scientific article; zbMATH DE number 3073410 (Why is no real title available?)
- Introduction to computational mathematics.
- Laplacians and the Cheeger inequality for directed graphs
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Markov chains and stochastic stability
- Mathematical aspects of mixing times in Markov chains.
- Matrix Analysis
- On entropy-type functionals arising in stochastic chemical kinetics related to the concentration of the invariant measure and playing the role of Lyapunov functions in the dynamics of quasiaverages
- On the efficiency of a randomized mirror descent algorithm in online optimization problems
- Parametric estimation. Finite sample theory
- Prediction, Learning, and Games
- Primal-dual subgradient methods for convex problems
- Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Regularization-based solution of the PageRank problem for large matrices
- Robust Stochastic Approximation Approach to Stochastic Programming
- Selected works
- Smooth minimization of non-smooth functions
- The concentration of measure phenomenon
- The Markov chain Monte Carlo revolution
- Using PageRank to Characterize Web Structure
Cited in
(12)- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- A Hessenberg-type algorithm for computing PageRank problems
- Deterministic coresets for stochastic matrices with applications to scalable sparse PageRank
- On the efficiency of a randomized mirror descent algorithm in online optimization problems
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
- Efficient numerical methods to solve sparse linear equations with application to PageRank
- Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
- Effective Computation of a Feedback Arc Set Using PageRank
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
- Secure fast evaluation of iterative methods: with an application to secure PageRank
This page was built for publication: On efficient randomized algorithms for finding the PageRank vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354453)
