Pages that link to "Item:Q5033336"

The following pages link to Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph (Q5033336):

Displaying 2 items.

• 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)