Pages that link to "Item:Q5036323"

The following pages link to A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph (Q5036323):

Displaying 8 items.

• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks (Q286157) (← links)
• Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph (Q989118) (← links)
• A matrix-based measure of inter-node walk relatedness in a network (Q1033899) (← links)
• Development of hierarchy theory for digraphs using concentration theory based on a new type of Lorenz curve (Q1410131) (← links)
• Generalized walks-based centrality measures for complex biological networks (Q1715403) (← links)
• Non-backtracking walk centrality for directed networks (Q3388879) (← 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 measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations (Q5093077) (← links)