The mathematics of Google: the PageRank algorithm
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Software, source code, etc. for problems pertaining to linear algebra (15-04) Positive matrices and their generalizations; cones of matrices (15B48) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorics (educational aspects) (97K20)
Recommendations
- The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
- About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
- How Google works?
- The mathematics of internet search engines
- Mathematical properties and analysis of Google's PageRank
Cited in
(16)- The mathematics of internet search engines
- Comparison of three Web search algorithms
- Perron vector optimization applied to search engines
- PageRank beyond the web
- Mathematical properties and analysis of Google's PageRank
- Some recent results on ranking webpages and websites
- The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
- A new method to find the eigenvalues of convex matrices with application in web page rating
- An adaptive improvement on PageRank algorithm
- Network essence: PageRank completion and centrality-conforming Markov chains
- The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming
- A search for champion boxers
- Walks: a beginner's guide to graphs and matrices
- Google's PageRank and beyond. The science of search engine rankings
- How Google works?
- Google pageranking problem: The model and the analysis
This page was built for publication: The mathematics of Google: the PageRank algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2881039)
