The Power of Quasi-Shortest Paths: ρ-Geodesic Betweenness Centrality

Abstract : Betweenness centrality metrics usually underestimate the importance of nodes that are close to shortest paths but do not exactly fall on them. In this paper, we reevaluate the importance of such nodes and propose the ρ-geodesic betweenness centrality, a novel metric that assigns weights to paths (and, consequently, to nodes on these paths) according to how close they are to shortest paths. The paths that are just slightly longer than the shortest one are defined as quasi-shortest paths, and they are able to increase or to decrease the importance of a node according to how often the node falls on them. We compare the proposed metric with the traditional, distance-scaled, and random walk betweenness centralities using four network datasets with distinct characteristics. The results show that the proposed metric, besides better assessing the topological role of a node, is also able to maintain the rank position of nodes overtime compared to the other metrics; this means that network dynamics affect less our metric than others. Such a property could help avoid, for instance, the waste of resources caused when data follow only the shortest paths and reduce associated costs.
Liste complète des métadonnées

Littérature citée [42 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01524360
Contributeur : Marcelo Dias de Amorim <>
Soumis le : jeudi 18 mai 2017 - 09:04:59
Dernière modification le : mardi 4 décembre 2018 - 01:23:19

Fichier

power-quasi-shortest.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Dianne S. V. Medeiros, Miguel Elias Mitre Campista, Nathalie Mitton, Marcelo Dias de Amorim, Guy Pujolle. The Power of Quasi-Shortest Paths: ρ-Geodesic Betweenness Centrality. IEEE Transactions on Network Science and Engineering, IEEE, 2017, 〈10.1109/TNSE.2017.2708705〉. 〈hal-01524360〉

Partager

Métriques

Consultations de la notice

385

Téléchargements de fichiers

116