A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph (Q5036323): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126355052, #quickstatements; #temporary_batch_1722357939539
 
(2 intermediate revisions by 2 users 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: Network Properties Revealed through Matrix Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: PageRank Beyond the Web / 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: Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/0022250x.2020.1711753 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2999228762 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126355052 / rank
 
Normal rank

Latest revision as of 18:03, 30 July 2024

scientific article; zbMATH DE number 7479814
Language Label Description Also known as
English
A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
scientific article; zbMATH DE number 7479814

    Statements

    Identifiers