A General Setting for the Parametric Google Matrix
From MaRDI portal
Publication:3519884
DOI10.1080/15427951.2006.10129131zbMath1146.65315MaRDI QIDQ3519884
Roger A. Horn, Stefano Serra Capizzano
Publication date: 19 August 2008
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2006.10129131
eigenvalues; eigenvector; conditioning; power method; Jordan blocks; extrapolation algorithm; PageRank vector; nonnegative, positive, and stochastic matrices; spectral and Jordan structures; stochastic Google matrix; web hyperlink matrix
68P10: Searching and sorting
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
15A21: Canonical forms, reductions, classification
15B51: Stochastic matrices
Related Items
A Dynamical System for PageRank with Time-Dependent Teleportation, Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update, Accelerated multigrid for graph Laplacian operators, Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem, Google pageranking problem: The model and the analysis, Acceleration of the generalized FOM algorithm for computing PageRank, Shift techniques for quasi-birth and death processes: canonical factorizations and matrix equations, The eigenvalue shift technique and its eigenstructure analysis of a matrix, PageRank Beyond the Web, Rational extrapolation for the PageRank vector
