On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (Q286157)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On graph combinatorics to improve eigenvector-based measures of centrality in directed networks |
scientific article; zbMATH DE number 6583109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On graph combinatorics to improve eigenvector-based measures of centrality in directed networks |
scientific article; zbMATH DE number 6583109 |
Statements
On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (English)
0 references
20 May 2016
0 references
centrality
0 references
eigenvector
0 references
PageRank
0 references
topology
0 references
network
0 references
0.7686493396759033
0 references
0.7572841048240662
0 references
0.7392957806587219
0 references
0.7333774566650391
0 references
