A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph

DOI10.1080/0022250X.2020.1711753zbMath1483.91166OpenAlexW2999228762WikidataQ126355052 ScholiaQ126355052MaRDI QIDQ5036323

Neng-Pin Lu

Publication date: 23 February 2022

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0022250x.2020.1711753

zbMATH Keywords

attenuationadjacency matrixcentrality

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90)

Related Items

A measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations

Cites Work

• A max version of the Perron-Frobenius theorem
• A new status index derived from sociometric analysis
• PageRank Beyond the Web
• Network Properties Revealed through Matrix Functions
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph