Mostra el registre d'ítem simple
On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
dc.contributor.author | Arratia Quesada, Argimiro Alejandro |
dc.contributor.author | Marijuan López, Carlos |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-09-29T14:12:42Z |
dc.date.available | 2018-09-01T00:30:23Z |
dc.date.issued | 2016-09-01 |
dc.identifier.citation | 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. |
dc.identifier.issn | 0024-3795 |
dc.identifier.uri | http://hdl.handle.net/2117/90335 |
dc.description | © 2016. This version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ |
dc.description.abstract | 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. |
dc.format.extent | 29 p. |
dc.language.iso | eng |
dc.publisher | Elsevier |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.lcsh | Algebras, Linear |
dc.subject.lcsh | Directed graphs |
dc.subject.other | Centrality |
dc.subject.other | Eigenvector |
dc.subject.other | PageRank |
dc.subject.other | Topology |
dc.subject.other | Network |
dc.title | On graph combinatorics to improve eigenvector-based measures of centrality in directed networks |
dc.type | Article |
dc.subject.lemac | Àlgebra lineal |
dc.subject.lemac | Grafs dirigits |
dc.contributor.group | Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge |
dc.identifier.doi | 10.1016/j.laa.2016.04.011 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0024379516301100 |
dc.rights.access | Open Access |
local.identifier.drac | 18763459 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Arratia, A.; Marijuan, C. |
local.citation.publicationName | Linear algebra and its applications |
local.citation.volume | 504 |
local.citation.startingPage | 325 |
local.citation.endingPage | 353 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [134]
-
Articles de revista [1.049]