Google pageranking problem: The model and the analysis
From MaRDI portal
For a given square complex matrix \(A\) and nonzero complex vectors \(x\) and \(v\) such that \(Ax=\lambda x\) and \(v^* x = 1\) the authors determine the eigenvalues, the Jordan blocks, and a distinguished left \(\lambda\)-vector of \(A(c)=c A + (1-c) \lambda x v^*\) as a function of the complex variable \(c\). As a special case of this result they obtain a complex analog of the Page-Rank for the web hyperlink matrix \(G(c)\) with a complex parameter \(c\).
Recommendations
- PageRank problem, survey and future research directions
- Mathematical properties and analysis of Google's PageRank
- An improved approach to the PageRank problems
- On some analytical properties of a general PageRank algorithm
- The mathematics of Google: the PageRank algorithm
- The PageRank model of minimal irreducible adjustment and its lumping method
- A Reordering for the PageRank Problem
- On computing PageRank via lumping the Google matrix
- A Survey on PageRank Computing
Cites work
- A formula for singular perturbations of Markov chains
- A General Setting for the Parametric Google Matrix
- A Survey of Eigenvector Methods for Web Information Retrieval
- An Arnoldi-type algorithm for computing Page Rank
- An inequality for nonnegative matrices and the inverse eigenvalue problem
- Comments on "Jordan Canonical Form of the Google Matrix"
- Conditioning of the entries in the stationary vector of a Google-type matrix
- Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
- Deeper Inside PageRank
- Extrapolation methods for PageRank computations
- Extrapolation methods theory and practice
- Fast linear iterations for distributed averaging
- Graph fibrations, graph isomorphism, and PageRank
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- scientific article; zbMATH DE number 1194487 (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?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Introduction to large truncated Toeplitz matrices
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- Matrix Analysis
- Numerical Methods for Structured Markov Chains
- On the solution of algebraic Riccati equations arising in fluid queues
- Rational extrapolation for the PageRank vector
- Shift Techniques and Canonical Factorizations in the Solution of M/G/1-Type Markov Chains
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
Cited in
(33)- On computing PageRank via lumping the Google matrix
- A Hessenberg-type algorithm for computing PageRank problems
- The sensitivity of a quantum PageRank
- Shift techniques for quasi-birth and death processes: canonical factorizations and matrix equations
- How to make the Perron eigenvector simple
- Steady-state analysis of google-like stochastic matrices with block iterative methods
- A multiparameter model for link analysis of citation graphs
- Perron vector optimization applied to search engines
- On some analytical properties of a general PageRank algorithm
- Symbolic dynamics methods and simulation of Internet search
- Mathematical properties and analysis of Google's PageRank
- Eigenvalues of certain augmented complex stochastic matrices with applications to PageRank
- The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
- Anderson transition for Google matrix eigenstates
- A General Setting for the Parametric Google Matrix
- PageRank Computation, with Special Attention to Dangling Nodes
- 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
- Towards Google matrix of brain
- The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming
- Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- The Effect of New Links on Google Pagerank
- Limit of PageRank with damping factor
- On the eigenvalues of specially low-rank perturbed matrices
- Spectral properties of Google matrix of Wikipedia and other networks
- Conditioning of the entries in the stationary vector of a Google-type matrix
- On perturbations of principal eigenvectors of substochastic matrices
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
- Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
- An Arnoldi-extrapolation algorithm for computing pagerank
This page was built for publication: Google pageranking problem: The model and the analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989122)
