Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph (Q4963386): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A max version of the Perron-Frobenius theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new status index derived from sociometric analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating the Largest Eigenvalue with the Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/0022250x.2017.1328680 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2622285752 / rank
 
Normal rank

Latest revision as of 09:42, 30 July 2024

scientific article; zbMATH DE number 6970699
Language Label Description Also known as
English
Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
scientific article; zbMATH DE number 6970699

    Statements

    Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph (English)
    0 references
    0 references
    2 November 2018
    0 references
    nonnegative eigenvector
    0 references
    power method
    0 references
    strongly connected component
    0 references

    Identifiers