PageRank problem, survey and future research directions

MaRDI QIDQ3577420zbMATH OpenFDO

Authors P. Sargolzaei, Fazlollah Soleymani

Publication date 22 July 2010

Full work available at URL http://www.m-hikari.com/imf-2010/17-20-2010/index.html

zbMATH Keywords

eigenvectorpagerankweb graphgoogle matrix

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Searching and sorting (68P10) Internet topics (68M11)

Recommendations

• Deeper Inside PageRank
• PageRank computation with MAAOR and lumping methods
• An improved approach to the PageRank problems
• About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
• A Hessenberg-type algorithm for computing PageRank problems

Cited in

(12)

• An improved approach to the PageRank problems
• PageRank computation with MAAOR and lumping methods
• Google pageranking problem: The model and the analysis
• Utilizing network structure to accelerate Markov chain Monte Carlo algorithms
• Regularization-based solution of the PageRank problem for large matrices
• Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to PageRank computation
• A Survey on PageRank Computing
• Information Retrieval Under Network Uncertainty: Robust Internet Ranking
• The PageRank model of minimal irreducible adjustment and its lumping method
• Efficient numerical methods to solve sparse linear equations with application to PageRank
• Review of statistical network analysis: models, algorithms, and software
• Black hole metric: overcoming the PageRank normalization problem

This page was built for publication: PageRank problem, survey and future research directions

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