Ordinal Ranking for Google's PageRank

DOI10.1137/070698129zbMath1284.62142OpenAlexW2073067135MaRDI QIDQ3642853

Rebecca S. Wills, Ilse C. F. Ipsen

Publication date: 6 November 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070698129

zbMATH Keywords

roundoff errorordinal rankpower methodstochastic matrixpagerankGoogle matrixranking distance

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Statistical ranking and selection procedures (62F07) Information storage and retrieval of data (68P20)

Related Items (9)

On the convergence of the minimally irreducible Markov chain method with applications to PageRank ⋮ Red light green light method for solving large Markov chains ⋮ A two-step matrix splitting iteration for computing PageRank ⋮ Choose the damping, choose the ranking? ⋮ A note on the two-step matrix splitting iteration for computing PageRank ⋮ PageRank Beyond the Web ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ A Dynamical System for PageRank with Time-Dependent Teleportation ⋮ Non-backtracking PageRank

This page was built for publication: Ordinal Ranking for Google's PageRank