Conditioning of the entries in the stationary vector of a Google-type matrix
From MaRDI portal
Publication:855557
DOI10.1016/j.laa.2006.03.007zbMath1110.15018OpenAlexW2031447082MaRDI QIDQ855557
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) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20) Stochastic matrices (15B51) Conditioning of matrices (15A12)
Related Items
Maximizing PageRank via outlinks, A combined approach for evaluating papers, authors and scientific journals, Google pageranking problem: The model and the analysis
Cites Work
- Non-negative matrices and Markov chains. 2nd ed
- Adaptive methods for the computation of PageRank
- Matrix Analysis
- Deeper Inside PageRank
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- Comparison of perturbation bounds for the stationary distribution of a Markov chain
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item