Eigenvector Centrality and Uniform Dominant Eigenvalue of Graph Components
Abstract
Eigenvector centrality is one of the outstanding measures of central tendency in graph theory. In this paper we consider the problem of calculating eigenvector centrality of graph partitioned into components and how this partitioning can be used. Two cases are considered; first where the a single component in the graph has the dominant eigenvalue, secondly when there are at least two components that share the dominant eigenvalue for the graph. In the first case we implement and compare the method to the usual approach (power method) for calculating eigenvector centrality while in the second case with shared dominant eigenvalues we show some theoretical and numerical results. Keywords: Eigenvector centrality, power iteration, graph, strongly connected component.
Keywords
Cite
@article{arxiv.2107.09137,
title = {Eigenvector Centrality and Uniform Dominant Eigenvalue of Graph Components},
author = {Collins Anguzu and Christopher Engström and John Magero Mango and Henry Kasumba and Sergei Silvestrov and Benard Abola},
journal= {arXiv preprint arXiv:2107.09137},
year = {2021}
}
Comments
21 pages