On variants of shortest-path betweenness centrality and their generic computation

  title={On variants of shortest-path betweenness centrality and their generic computation},
  author={Ulrik Brandes},
  journal={Soc. Networks},
  • U. Brandes
  • Published 1 May 2008
  • Computer Science
  • Soc. Networks

Figures from this paper

The delta-betweenness centrality

  • A. PlutovM. Segal
  • Computer Science
    2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
  • 2013
This paper presents an efficient algorithm for computing the betweenness centrality measure, which is used in social and computer communication networks to estimate the potential monitoring and control capabilities a node may have on data flowing in the network.

Finding Critical Links for Closeness Centrality

Closeness centrality is a class of distance-based measures in the network analysis literature to quantify reachability of a given vertex (or a group of vertices) by other network agents. In this pa...

Computing betweenness centrality in external memory

This paper describes the first known external-memory and cache-oblivious algorithms for computing betweenness centrality, and describes general algorithms for networks with weighted and unweighted edges and a specialized algorithm with small diameters, as is common in social networks exhibiting the “small worlds” phenomenon.

A stable betweenness centrality measure in networks

It is shown that the well-known betweenness centrality is not stable with respect to that metric and an alternative definition that preserves the same centrality notion while satisfying this stability criterion is introduced.

A Faster Algorithm to Update Betweenness Centrality After Node Alteration

This work proposes a technique to update betweenness centrality of a graph when nodes are added or deleted, and speeds up the calculation of betweennessCentrality from 7 to 412 times in comparison to the currently best-known techniques.

Centrality scaling in large networks.

A multiscale decomposition of shortest paths shows that the contributions to betweenness coming from geodesics not longer than L obey a characteristic scaling versus L, which can be used to predict the distribution of the full centralities.

Correlation analysis of nodes and edges centrality measures in artificial complex networks

Two alternative measures, WERW-Kpath and Game of Thieves, are focused on, which are at the same time highly descriptive and computationally affordable and suggest the possibility of using them as useful and more economic replacements of the classical centrality measures.

Sink Group Betweenness Centrality

The concept of Sink Group Node Betweenness centrality is introduced to identify those nodes in a network that can “monitor” the geodesic paths leading towards a set of subsets of nodes.

A Survey on the Role of Centrality as Seed Nodes for Information Propagation in Large Scale Network

It is observed that most of the centrality measures perform well compared to the actual source in the initial stage but are saturated after a certain level of influence maximization in terms of both affected nodes and propagation level.



A set of measures of centrality based upon betweenness

A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced, used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.

Centrality Estimation in Large Networks

An experimental study of the quality of centrality scores estimated from a limited number of SSSP computations under various selection strategies for the source vertices is presented.

Better Approximation of Betweenness Centrality

A framework for unbiased approximation of betweenness is proposed that generalizes a previous approach by Brandes and yields significantly better approximation than before for many real world inputs and good approximations for the betweenness of unimportant nodes.

A measure of betweenness centrality based on random walks

A faster algorithm for betweenness centrality

New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.

Fast algorithm for successive computation of group betweenness centrality.

A method for rapid computation of group betweenness centrality whose running time (after preprocessing) does not depend on network size and may assist in finding further properties of complex networks and may open a wide range of research opportunities.

A Graph-theoretic perspective on centrality