Google pageranking problem: The model and the analysis (Q989122): Difference between revisions
From MaRDI portal
Revision as of 02:50, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Google pageranking problem: The model and the analysis |
scientific article |
Statements
Google pageranking problem: The model and the analysis (English)
0 references
27 August 2010
0 references
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\).
0 references
Google matrix
0 references
pageranking
0 references
surfing model
0 references
rank-one perturbation
0 references
Brauer's theorem
0 references
Jordan canonical form
0 references
principle of biorthogonality
0 references
extrapolation formulae
0 references
Page-Rank
0 references
0 references
0 references
0 references