Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph

Neng-Pin Lu

The Journal of Mathematical Sociology, 2019, vol. 43, issue 3, 164-178

Abstract: Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider only the strongly connected component whose adjacency submatrix has the largest eigenvalue. In this paper, for each and every strongly connected component in a digraph, we add weights to diagonal elements of its member nodes in the adjacency matrix such that the modified matrix will have the new unique largest eigenvalue and corresponding principal eigenvectors. Consequently, we use the new principal eigenvectors of the modified matrices, based on different strongly connected components, not only to compose centrality measures but also to identify bowtie structures for a digraph.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/0022250X.2018.1555827 (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:43:y:2019:i:3:p:164-178

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

DOI: 10.1080/0022250X.2018.1555827

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 ().