The extrapolation-accelerated multilevel aggregation method in PageRank computation
From MaRDI portal
(Redirected from Publication:473754)
Summary: An accelerated multilevel aggregation method is presented for calculating the stationary probability vector of an irreducible stochastic matrix in PageRank computation, where the vector extrapolation method is its accelerator. We show how to periodically combine the extrapolation method together with the multilevel aggregation method on the finest level for speeding up the PageRank computation. Detailed numerical results are given to illustrate the behavior of this method, and comparisons with the typical methods are also made.
Recommendations
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- A new extrapolation method for PageRank computations
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Extrapolation methods for PageRank computations
- The finest level acceleration of multilevel aggregation for Markov chains
Cites work
- A hybrid algorithm for queueing systems
- A Polynomial Extrapolation Method for Finding Limits and Antilimits of Vector Sequences
- A Reordering for the PageRank Problem
- A Survey on PageRank Computing
- Acceleration Techniques for Iterated Vector and Matrix Problems
- Adaptive Algebraic Multigrid
- Adaptive methods for the computation of PageRank
- Adaptive Smoothed Aggregation (\alphaSA) Multigrid
- An Algebraic Multigrid Preconditioner for a Class of Singular M-Matrices
- An Arnoldi-extrapolation algorithm for computing pagerank
- An Arnoldi-type algorithm for computing Page Rank
- Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
- Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices
- Deeper Inside PageRank
- Existence and uniqueness of splittings for stationary iterative methods with applications to alternating methods
- Extrapolation methods for PageRank computations
- Extrapolation Methods for Vector Sequences
- Google's PageRank and beyond. The science of search engine rankings
- scientific article; zbMATH DE number 3776540 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- Numerical Methods for Structured Markov Chains
- On computing PageRank via lumping the Google matrix
- PageRank Computation, with Special Attention to Dangling Nodes
- Rational extrapolation for the PageRank vector
- Recursively accelerated multilevel aggregation for Markov chains
- Smoothed aggregation multigrid for Markov chains
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains
- Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
Cited in
(8)- A cost-effective smoothed multigrid with modified neighborhood-based aggregation for Markov chains
- An efficient elimination strategy for solving PageRank problems
- Extrapolation methods for PageRank computations
- Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems
- Vector Aitken extrapolation method for multilinear PageRank computations
- Multilevel aggregation methods for small-world graphs with application to random-walk ranking
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- FOM accelerated by an extrapolation method for solving PageRank problems
This page was built for publication: The extrapolation-accelerated multilevel aggregation method in PageRank computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473754)
