Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs release_ykcs67vn5jczrojrweza6jgxcy

by Mostafa Haghir Chehreghani and Albert Bifet and Talel Abdessalem

Released as a article .

2017  

Abstract

Graphs are an important tool to model data in different domains, including social networks, bioinformatics and the world wide web. Most of the networks formed in these domains are directed graphs, where all the edges have a direction and they are not symmetric. Betweenness centrality is an important index widely used to analyze networks. In this paper, first given a directed network G and a vertex r ∈ V(G), we propose a new exact algorithm to compute betweenness score of r. Our algorithm pre-computes a set RV(r), which is used to prune a huge amount of computations that do not contribute in the betweenness score of r. Time complexity of our exact algorithm depends on |RV(r)| and it is respectively Θ(|RV(r)|·|E(G)|) and Θ(|RV(r)|·|E(G)|+|RV(r)|·|V(G)| |V(G)|) for unweighted graphs and weighted graphs with positive weights. |RV(r)| is bounded from above by |V(G)|-1 and in most cases, it is a small constant. Then, for the cases where RV(r) is large, we present a simple randomized algorithm that samples from RV(r) and performs computations for only the sampled elements. We show that this algorithm provides an (ϵ,δ)-approximation of the betweenness score of r. Finally, we perform extensive experiments over several real-world datasets from different domains for several randomly chosen vertices as well as for the vertices with the highest betweenness scores. Our experiments reveal that in most cases, our algorithm significantly outperforms the most efficient existing randomized algorithms, in terms of both running time and accuracy. Our experiments also show that our proposed algorithm computes betweenness scores of all vertices in the sets of sizes 5, 10 and 15, much faster and more accurate than the most efficient existing algorithms.
In text/plain format

Archived Files and Locations

application/pdf  294.2 kB
file_5wisupen4jcp3h5otvw7bmjrii
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-08-28
Version   v1
Language   en ?
arXiv  1708.08739v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: fb846c9a-ee5a-4474-ba3b-50a0f843866f
API URL: JSON