2026-04-22T21:34:27Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/408072021-06-24T07:41:30Zcom_10324_32197com_10324_952com_10324_894col_10324_32199

Arratia, Argimiro Marijuán López, Carlos 2020-04-17T11:40:06Z 2020-04-17T11:40:06Z 2016 Linear Algebra and its Applications, 2016, vol. 504. p. 325-353 0024-3795 http://uvadoc.uva.es/handle/10324/40807 10.1016/j.laa.2016.04.011 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. eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/4.0/ © 2016 Elsevier Attribution-NonCommercial-NoDerivatives 4.0 Internacional On graph combinatorics to improve eigenvector-based measures of centrality in directed networks info:eu-repo/semantics/article