Google pageranking problem: The model and the analysis (Q989122): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2010.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967947550 / rank
 
Normal rank

Revision as of 23:47, 19 March 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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references