PageRank Computation, with Special Attention to Dangling Nodes
DOI10.1137/060664331zbMath1156.65038OpenAlexW1985129090MaRDI QIDQ3537449
Ilse C. F. Ipsen, Teresa M. Selee
Publication date: 6 November 2008
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/88391d7c1cf1d1f2f5e9d35324aa0ef957b0c051
algorithmstationary distributionsimilarity transformationpower methodstochastic matrixJordan decompositionrank-one matrixPageRanklumpingGoogle matrixdangling nodes
Computational methods for sparse matrices (65F50) Searching and sorting (68P10) Numerical analysis or methods applied to Markov chains (65C40) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Information storage and retrieval of data (68P20) Linear equations (linear algebraic aspects) (15A06) Canonical forms, reductions, classification (15A21) Stochastic matrices (15B51)
Related Items