Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
نویسندگان
چکیده
Graphs (networks) 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)| log |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 whereRV(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 proMostafa Haghir Chehreghani LTCI, Télécom ParisTech, Université Paris-Saclay, 75013 Paris FRANCE Tel.: +33-760502240 E-mail: [email protected] Albert Bifet LTCI, Télécom ParisTech, Université Paris-Saclay, 75013 Paris FRANCE E-mail: [email protected] Talel Abdessalem LTCI, Télécom ParisTech, Université Paris-Saclay, 75013 Paris FRANCE E-mail: [email protected] 2 Mostafa Haghir Chehreghani et al. posed 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.
منابع مشابه
Centrality Measures on Big Graphs: Exact, Approximated, and Distributed Algorithms
Centrality measures allow to measure the relative importance of a node or an edge in a graph w.r.t. other nodes or edges. Several measures of centrality have been developed in the literature to capture different aspects of the informal concept of importance, and algorithms for these different measures have been proposed. In this tutorial, we survey the different definitions of centrality measur...
متن کاملKADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
We present KADABRA, a new algorithm to approximate betweenness centrality in directed and undirected graphs, which significantly outperforms all previous approaches on real-world complex networks. The efficiency of the new algorithm relies on two new theoretical contribution, of independent interest. The first contribution focuses on sampling shortest paths, a subroutine used by most algorithms...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملApproximating Betweenness Centrality in Large Evolving Networks
Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For static networks, approximation based on randomly sampled paths has been shown to be significantly faster in practice. However, for dynamic networks, no approximation algorithm for betweenness centrali...
متن کاملApproximating Betweenness Centrality in Fully Dynamic Networks
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Because exact computations are prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in networks that change over ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.08739 شماره
صفحات -
تاریخ انتشار 2017