Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On graph combinatorics to improve eigenvector-based measures of centrality in directed networks

Autor
Arratia, A.; Marijuan, C.
Tipus d'activitat
Article en revista
Revista
Linear algebra and its applications
Data de publicació
2016-09-01
Volum
504
Pàgina inicial
325
Pàgina final
353
DOI
https://doi.org/10.1016/j.laa.2016.04.011 Obrir en finestra nova
Projecte finançador
Aprendizaje Computacional y Comunicación
Repositori
http://hdl.handle.net/2117/90335 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0024379516301100 Obrir en finestra nova
Resum
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 diff...
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.
Paraules clau
Centrality, Eigenvector, Network, PageRank, Topology
Grup de recerca
LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

Participants