162
Views
4
CrossRef citations to date
0
Altmetric
Articles

Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph

Pages 139-154 | Received 20 Oct 2016, Accepted 07 May 2017, Published online: 07 Jun 2017
 

ABSTRACT

Eigenvector centrality is a popular measure that uses the principal eigenvector of the adjacency matrix to distinguish importance of nodes in a graph. To find the principal eigenvector, the power method iterating from a random initial vector is often adopted. In this article, we consider the adjacency matrix of a directed graph and choose suitable initial vectors according to strongly connected components of the graph instead so that nonnegative eigenvectors, including the principal one, can be found. Consequently, for aggregating nonnegative eigenvectors, we propose a weighted measure of centrality, called the aggregated-eigenvector centrality. Weighting each nonnegative eigenvector by the reachability of the associated strongly connected component, we can obtain a measure that follows a status hierarchy in a directed graph.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 53.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,078.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.