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

Neng-Pin Lu

The Journal of Mathematical Sociology, 2021, vol. 45, issue 1, 51-64

Abstract: For measuring the centrality in a digraph, Bonacich and Lloyd summarized a vector, from the power series of an attenuated adjacency matrix, as the alpha centrality. However, scores of alpha centrality are usually dominated by nodes in the strongly connected component, which owns the largest eigenvalue of the adjacency matrix. In this paper, based on reachability between strongly connected components, we consider not only the largest eigenvalue but also the other smaller ones to attenuate the adjacency matrix hierarchically; and obtain a measure from the power series of the hierarchically attenuated adjacency matrix. Consequently, we propose the hierarchical alpha centrality, which can yield higher scores for nodes at higher hierarchies of reachability in a digraph.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/0022250X.2020.1711753 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:gmasxx:v:45:y:2021:i:1:p:51-64

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/gmas20

DOI: 10.1080/0022250X.2020.1711753

Access Statistics for this article

The Journal of Mathematical Sociology is currently edited by Noah Friedkin

More articles in The Journal of Mathematical Sociology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().