Two betweenness centrality measures based on Randomized Shortest Paths

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP's have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice.

Description

VK: Saramäki, J.; Triton

DOI

10.1038/srep19668

Citation

Kivimäki, I, Lebichot, B, Saramäki, J & Saerens, M 2016, 'Two betweenness centrality measures based on Randomized Shortest Paths', Scientific Reports, vol. 6, 19668, pp. 1-15. https://doi.org/10.1038/srep19668

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-201705114061

Collections

[article-cris] Perustieteiden korkeakoulu / SCI

Show all metadata

Two betweenness centrality measures based on Randomized Shortest Paths

Access rights

URL

Journal Title

Journal ISSN

Volume Title

Authors

Date

Department

Major/Subject

Mcode

Degree programme

Language

Pages

Series

Abstract

Description

Keywords

Other note

DOI

Citation

Permanent link to this item

Collections