A new centrality measure in dense networks based on two-way random walk betweenness

Empreu sempre aquest identificador per citar o enllaçar aquest ítem http://hdl.handle.net/10045/117407
Información del item - Informació de l'item - Item information
Títol: A new centrality measure in dense networks based on two-way random walk betweenness
Autors: Curado, Manuel | Rodriguez, Rocio | 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 walks | Densification
Àrees de coneixement: Ciencia de la Computación e Inteligencia Artificial
Data de publicació: 1-de gener-2022
Editor: Elsevier
Citació bibliogràfica: Applied Mathematics and Computation. 2022, 412: 126560. https://doi.org/10.1016/j.amc.2021.126560
Resum: Many scholars have tried to address the identification of critical nodes in complex networks from different perspectives. For instance, by means of the betweenness methods based on shortest paths and random walk, it is possible to measure the global importance of a node as an intermediate node. All these metrics have the common characteristic of not taking into account the density of the clusters. In this paper, we apply an analysis of network centrality, from a perspective oriented to ranking nodes, reinforcing dense communities using evaluating graphs using a two-trip transition probability matrix. We define a new centrality measure based on random walk betweenness. We study and analyse the new metric as a betweenness centrality measure with common characteristics with Pagerank, presenting through its practical implementation in some examples based on synthetic, and testing with well-known real-world networks. This method helps to increase the ranking of nodes belonging to dense clusters with a higher average degree than the remaining clusters, and it can detect the weakness of a network comparing it with the classical betweenness centrality measure.
URI: http://hdl.handle.net/10045/117407
ISSN: 0096-3003 (Print) | 1873-5649 (Online)
DOI: 10.1016/j.amc.2021.126560
Idioma: eng
Tipus: info:eu-repo/semantics/article
Drets: © 2021 Elsevier Inc.
Revisió científica: si
Versió de l'editor: https://doi.org/10.1016/j.amc.2021.126560
Apareix a la col·lecció: INV - ANVIDA - Artículos de Revistas

Arxius per aquest ítem:
Arxius per aquest ítem:
Arxiu Descripció Tamany Format  
ThumbnailCurado_etal_2022_ApplMathComput_final.pdfVersión final (acceso restringido)5,03 MBAdobe PDFObrir     Sol·licitar una còpia


Tots els documents dipositats a RUA estan protegits per drets d'autors. Alguns drets reservats.