RT info:eu-repo/semantics/article
T1 On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
A1 Arratia, Argimiro
A1 Marijuán López, Carlos
K1 Centrality
K1 Centralidad
K1 Eigenvector
K1 Vector propio
K1 Topology
K1 Topología
K1 Network
K1 Red informática
AB 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 α-centrality and PageRank.
PB Elsevier
SN 0024-3795
YR 2016
FD 2016
LK http://uvadoc.uva.es/handle/10324/40807
UL http://uvadoc.uva.es/handle/10324/40807
LA eng
NO Linear Algebra and its Applications, 2016, vol. 504. p. 325-353
NO Producción Científica
DS UVaDOC
RD 24-nov-2024