A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes
Empreu sempre aquest identificador per citar o enllaçar aquest ítem
http://hdl.handle.net/10045/125978
Títol: | A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes |
---|---|
Autors: | Curado, Manuel | Rodriguez, Rocio | Terroso-Sáenz, Fernando | Tortosa, Leandro | Vicent, Jose F. |
Grups d'investigació o GITE: | Análisis y Visualización de Datos en Redes (ANVIDA) |
Centre, Departament o Servei: | Universidad de Alicante. Departamento de Ciencia de la Computación e Inteligencia Artificial |
Paraules clau: | Centrality measure | Betweenness centrality | Random paths | Densification |
Data de publicació: | 10-d’agost-2022 |
Editor: | Elsevier |
Citació bibliogràfica: | Journal of Computational Science. 2022, 63: 101819. https://doi.org/10.1016/j.jocs.2022.101819 |
Resum: | Centrality metrics are one of the most meaningful features in a large number of real-world network systems. In that sense, the Betweenness centrality is a widely used measurement that quantifies the importance of a node in the information flow in a network. Moreover, there is a centrality measure, based on random-paths betweenness centrality, that provides a classification of the nodes of undirected networks, that are able to reinforce dense communities according to their role. In this paper, a new centrality model, based on random-paths betweenness centrality and applied on directed networks, is presented. This model, based on four indices, describes the behaviour of the nodes within the network in terms of its role, such as a transition node, in the same cluster or between clusters. Finally, we evaluate the model with several use cases based on real networks, two of them are proposed and created in this paper, giving insight into some interesting findings about the networks’ features. |
Patrocinadors: | Financial support for this research has been provided under grant PID2020-112827GB-I00 funded by MCIN/AEI/10.13039/501100011033. |
URI: | http://hdl.handle.net/10045/125978 |
ISSN: | 1877-7503 (Print) | 1877-7511 (Online) |
DOI: | 10.1016/j.jocs.2022.101819 |
Idioma: | eng |
Tipus: | info:eu-repo/semantics/article |
Drets: | © 2022 Elsevier B.V. |
Revisió científica: | si |
Versió de l'editor: | https://doi.org/10.1016/j.jocs.2022.101819 |
Apareix a la col·lecció: | INV - ANVIDA - Artículos de Revistas |
Arxius per aquest ítem:
Arxiu | Descripció | Tamany | Format | |
---|---|---|---|---|
Curado_etal_2022_JComputSci_accepted.pdf | Embargo 24 meses (acceso abierto: 11 ag. 2024) | 3,01 MB | Adobe PDF | Obrir Sol·licitar una còpia |
Curado_etal_2022_JComputSci_final.pdf | Versión final (acceso restringido) | 2,1 MB | Adobe PDF | Obrir Sol·licitar una còpia |
Tots els documents dipositats a RUA estan protegits per drets d'autors. Alguns drets reservats.