A decentralized algorithm for spectral analysis (Q5920385): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4473321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authoritative sources in a hyperlinked environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral analysis of data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fastest Mixing Markov Chain on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perturbation of LU and Cholesky factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation theory for pseudo-inverses / rank
 
Normal rank

Revision as of 12:47, 27 June 2024

scientific article; zbMATH DE number 5216958
Language Label Description Also known as
English
A decentralized algorithm for spectral analysis
scientific article; zbMATH DE number 5216958

    Statements

    A decentralized algorithm for spectral analysis (English)
    0 references
    0 references
    0 references
    30 November 2007
    0 references
    eigenvectors
    0 references
    spectral analysis
    0 references
    decentralized algorithm
    0 references
    Markov chain
    0 references
    large networks
    0 references

    Identifiers

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