PageRank Computation, with Special Attention to Dangling Nodes

DOI10.1137/060664331MaRDI QIDQ3537449zbMATH OpenOpenAlexFDO

Authors Ilse C. F. Ipsen, Teresa M. Selee

Publication date 6 November 2008

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/88391d7c1cf1d1f2f5e9d35324aa0ef957b0c051

zbMATH Keywords

Jordan decompositionalgorithmstochastic matrixsimilarity transformationstationary distributionPageRankrank-one matrixlumpingpower methodGoogle matrixdangling nodes

Mathematics Subject Classification ID

Numerical analysis or methods applied to Markov chains (65C40) Computational methods for sparse matrices (65F50) Information storage and retrieval of data (68P20) Eigenvalues, singular values, and eigenvectors (15A18) Searching and sorting (68P10) Linear equations (linear algebraic aspects) (15A06) Iterative numerical methods for linear systems (65F10) Canonical forms, reductions, classification (15A21) Stochastic matrices (15B51)

Recommendations

• On computing PageRank via lumping the Google matrix
• A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations
• The PageRank model of minimal irreducible adjustment and its lumping method
• Google pageranking problem: The model and the analysis
• An improved approach to the PageRank problems

Cited in

(26)

• PageRank computation with MAAOR and lumping methods
• Acceleration of the generalized FOM algorithm for computing PageRank
• A Survey on PageRank Computing
• A note on the two-step matrix splitting iteration for computing PageRank
• A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
• Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
• PageRank, Connecting a Line of Nodes with a Complete Graph
• A two-step matrix splitting iteration for computing PageRank
• On perturbations of principal eigenvectors of substochastic matrices
• Generalisation of the Damping Factor in PageRank for Weighted Networks
• Convergence of multi-level iterative aggregation-disaggregation methods
• An extrapolation iteration and its lumped type iteration for computing PageRank
• On computing PageRank via lumping the Google matrix
• An Arnoldi-extrapolation algorithm for computing pagerank
• On computing HITS ExpertRank via lumping the hub matrix
• The extrapolation-accelerated multilevel aggregation method in PageRank computation
• The PageRank model of minimal irreducible adjustment and its lumping method
• Predicting adolescent social networks to stop smoking in secondary schools
• Rational extrapolation for the PageRank vector
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• A note on certain ergodicity coefficients
• A general multi-splitting iteration method for computing PageRank
• Physiology and pathology of iterative aggregation-disaggregation methods.
• On the multi-splitting iteration method for computing PageRank
• Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank
• Multi-linear pseudo-PageRank for hypergraph partitioning

This page was built for publication: PageRank Computation, with Special Attention to Dangling Nodes

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