On perturbations of principal eigenvectors of substochastic matrices
From MaRDI portal
Publication:891303
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Eigenvalues, singular values, and eigenvectors (15A18) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic matrices (15B51)
Recommendations
- Mathematical properties and analysis of Google's PageRank
- The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
- Google pageranking problem: The model and the analysis
- Conditioning of the entries in the stationary vector of a Google-type matrix
- PageRank Computation, with Special Attention to Dangling Nodes
Cites work
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- A Singular Perturbation Approach for Choosing the PageRank Damping Factor
- A Survey of Eigenvector Methods for Web Information Retrieval
- Adaptive methods for the computation of PageRank
- An Arnoldi-type algorithm for computing Page Rank
- Google's PageRank and beyond. The science of search engine rankings
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
- On some analytical properties of a general PageRank algorithm
- Rational extrapolation for the PageRank vector
This page was built for publication: On perturbations of principal eigenvectors of substochastic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891303)