Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation

DOI10.1137/S0895479804441407MaRDI QIDQ5470463zbMATH OpenOpenAlexFDO

Authors Stefano Serra Capizzano

Publication date 31 May 2006

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

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

zbMATH Keywords

canonical Jordan formdominant eigenvalueextrapolationGoogle matrixleft eigenvectorpage-rank computationpower method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Google pageranking problem: The model and the analysis
• A General Setting for the Parametric Google Matrix
• Comments on "Jordan Canonical Form of the Google Matrix"
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Extrapolation methods for PageRank computations

Cited in

(35)

• On computing PageRank via lumping the Google matrix
• A relaxed two-step splitting iteration method for computing PageRank
• Extrapolation methods for PageRank computations
• A ``shift-and-deflate technique for quadratic matrix polynomials
• How to make the Perron eigenvector simple
• On some analytical properties of a general PageRank algorithm
• Comparison of Krylov subspace methods on the PageRank problem
• PageRank beyond the web
• A model to classify users of social networks based on PageRank
• Proof of the hamiltonicity-trace conjecture for singularly perturbed Markov chains
• The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
• A General Setting for the Parametric Google Matrix
• Rational extrapolation for the PageRank vector
• A new method to find the eigenvalues of convex matrices with application in web page rating
• Comments on "Jordan Canonical Form of the Google Matrix"
• Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
• Recent advances in bibliometric indexes and the PaperRank problem
• A note on certain ergodicity coefficients
• Tunable eigenvector-based centralities for multiplex and temporal networks
• On the eigenvalues of specially low-rank perturbed matrices
• Spectral properties of Google matrix of Wikipedia and other networks
• The Kemeny constant for finite homogeneous ergodic Markov chains
• Competitivity groups on social network sites
• The maps: strong clustering and distribution results on the complex unit circle
• A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• Theory of Krylov subspace methods based on the Arnoldi process with inexact inner products
• Influence of the automorphism group of a graph on its PageRank scores of vertices
• A note on the pagerank algorithm
• An Arnoldi-type algorithm for computing Page Rank
• Conditioning of the entries in the stationary vector of a Google-type matrix
• FOM accelerated by an extrapolation method for solving PageRank problems
• 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
• An Arnoldi-extrapolation algorithm for computing pagerank

This page was built for publication: Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470463)