A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph (Q5036323): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 02:34, 28 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
A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph (English)
0 references
23 February 2022
0 references
adjacency matrix
0 references
attenuation
0 references
centrality
0 references
0 references
