Conditioning of the entries in the stationary vector of a Google-type matrix
DOI10.1016/J.LAA.2006.03.007zbMATH Open1110.15018OpenAlexW2031447082MaRDI QIDQ855557FDOQ855557
Publication date: 7 December 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.03.007
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Conditioning of matrices (15A12) Stochastic matrices (15B51)
Cites Work
- Matrix Analysis
- Combinatorial matrix theory
- Deeper Inside PageRank
- Non-negative matrices and Markov chains. 2nd ed
- Adaptive methods for the computation of PageRank
- Title not available (Why is that?)
- Title not available (Why is that?)
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- IJCAI '01: 17th international joint conference on artificial intelligence (2-volume \& CD set)
- Comparison of perturbation bounds for the stationary distribution of a Markov chain
Cited In (4)
Recommendations
- Mathematical properties and analysis of Google's PageRank 👍 👎
- Google pageranking problem: The model and the analysis 👍 👎
- Comments on "Jordan Canonical Form of the Google Matrix" 👍 👎
- On perturbations of principal eigenvectors of substochastic matrices 👍 👎
- A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain 👍 👎
This page was built for publication: Conditioning of the entries in the stationary vector of a Google-type matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855557)
