A Reordering for the PageRank Problem

DOI10.1137/040607551MaRDI QIDQ5470406zbMATH OpenOpenAlexWikidataFDO

Authors Amy N. Langville, Carl D. Meyer

Publication date 30 May 2006

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL http://www.lib.ncsu.edu/resolver/1840.4/447

zbMATH Keywords

convergencenumerical examplessparse matrixalgorithmMarkov chainsPageRankpower methodGoogle matrixstationary vectordangling nodesreorderings

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Computational methods for sparse matrices (65F50)

Recommendations

• An adaptive reordered method for computing PageRank
• On accelerating the PageRank computation
• Fast PageRank Computation via a Sparse Linear System
• An improved approach to the PageRank problems
• Algorithms and Models for the Web-Graph

Cited in

(33)

• An improved approach to the PageRank problems
• An adaptive reordered method for computing PageRank
• PageRank computation with MAAOR and lumping methods
• Online dynamic reordering
• On adaptively accelerated Arnoldi method for computing PageRank.
• Non-backtracking PageRank
• Google pageranking problem: The model and the analysis
• A Hessenberg-type algorithm for computing PageRank problems
• scientific article; zbMATH DE number 2243086 (Why is no real title available?)
• Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques
• Fast PageRank Computation via a Sparse Linear System
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• Ordering Web Pages by Cross-Link Information
• Axiomatic characterization of PageRank
• The Effect of New Links on Google Pagerank
• Ordinal Ranking for Google's PageRank
• On the convergence of the minimally irreducible Markov chain method with applications to PageRank
• A two-step matrix splitting iteration for computing PageRank
• Convergence of multi-level iterative aggregation-disaggregation methods
• An efficient elimination strategy for solving PageRank problems
• Resolving degeneracies in Google search via quantum stochastic walks
• A relaxed two-step splitting iteration method for computing PageRank
• On computing PageRank via lumping the Google matrix
• An Arnoldi-extrapolation algorithm for computing pagerank
• The extrapolation-accelerated multilevel aggregation method in PageRank computation
• PageRank for networks, graphs, and Markov chains
• Physiology and pathology of iterative aggregation-disaggregation methods.
• On the multi-splitting iteration method for computing PageRank
• A variant of the Power-Arnoldi algorithm for computing PageRank
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank
• Network structure exploration via Bayesian nonparametric models
• Multi-linear pseudo-PageRank for hypergraph partitioning

This page was built for publication: A Reordering for the PageRank Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470406)