Conditioning of the entries in the stationary vector of a Google-type matrix (Q855557): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2006.03.007 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2006.03.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031447082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of perturbation bounds for the stationary distribution of a Markov chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive methods for the computation of PageRank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deeper Inside PageRank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2006.03.007 / rank
 
Normal rank

Latest revision as of 05:37, 10 December 2024

scientific article
Language Label Description Also known as
English
Conditioning of the entries in the stationary vector of a Google-type matrix
scientific article

    Statements

    Conditioning of the entries in the stationary vector of a Google-type matrix (English)
    0 references
    7 December 2006
    0 references
    Given a stationary vector \(\alpha^T\) of a stochastic matrix of the form \(cA + (I - c)B\), where \(c \in(0, 1)\) is a scalar, and \(A\) and \(B\) are stochastic matrices, with rank \(B\) = 1, condition bounds for \(\alpha^T\) are given. Based on combinatorial and analytic techniques the conditioning bounds considered include normwise, absolute componentwise, and relative componentwise bounds. The bounds depend on \(c\), and on quantities such as the number of dangling nodes (which correspond to rows of \(A\) having all entries equal), or the lengths of certain cycles in the directed graph associated with \(A\). If a vertex is on only long cycles in that directed graph, then the corresponding entry in \(\alpha^T\) exhibits better conditioning properties, and that for dangling nodes, the sensitivity of the corresponding entries in \(\alpha^T\) decreases as the number of dangling nodes increases. Conditions are given that are sufficient to ensure that an iterate of the power method accurately reflects the relative ordering of two entries in \(\alpha^T\).
    0 references
    Stochastic matrix
    0 references
    stationary vector
    0 references
    condition number
    0 references
    PageRank
    0 references
    rank
    0 references
    directed graph
    0 references
    power method
    0 references
    0 references

    Identifiers

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