Pages that link to "Item:Q4963386"
From MaRDI portal
The following pages link to Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph (Q4963386):
Displaying 3 items.
- 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)
- A measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations (Q5093077) (← links)
