Pages that link to "Item:Q286157"
From MaRDI portal
The following pages link to On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (Q286157):
Displaying 6 items.
- Vector centrality in hypergraphs (Q2677395) (← links)
- A note on a generalization of eigenvector centrality for bipartite graphs and applications (Q2892162) (← links)
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis (Q4604568) (← links)
- Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph (Q5033336) (← links)
- A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph (Q5036323) (← links)
- Geometric and spectral analysis on weighted digraphs (Q6199678) (← links)