On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
Tipus de documentArticle
Condicions d'accésAccés restringit per política de l'editorial (embargat fins 2018-09-01)
We present a combinatorial study on the rearrangement of links in the structure of directed networks for the purpose of improving the valuation of a vertex or group of vertices as established by an eigenvector-based centrality measure. We build our topological classification starting from unidirectional rooted trees and up to more complex hierarchical structures such as acyclic digraphs, bidirectional and cyclical rooted trees (obtained by closing cycles on unidirectional trees). We analyze different modifications on the structure of these networks and study their effect on the valuation given by the eigenvector-based scoring functions, with particular focus on alpha-centrality and PageRank.
© 2016. This version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
CitacióArratia, A., Marijuan, C. On graph combinatorics to improve eigenvector-based measures of centrality in directed networks. "Linear algebra and its applications", 1 Setembre 2016, vol. 504, p. 325-353.
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0024379516301100