A faster algorithm for betweenness centrality

  title={A faster algorithm for betweenness centrality},
  author={Ulrik Brandes},
  journal={The Journal of Mathematical Sociology},
  pages={163 - 177}
  • U. Brandes
  • Published 1 June 2001
  • Mathematics
  • The Journal of Mathematical Sociology
Motivated by the fast‐growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They 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. Experimental evidence is provided that this substantially increases the range of networks for which centrality analysis is feasible. The betweenness centrality index is essential in… Expand
Approximating Betweenness Centrality
This paper presents a novel approximation algorithm for computing betweenness centrality of a given vertex, for both weighted and unweighted graphs, based on an adaptive sampling technique that significantly reduces the number of single-source shortest path computations for vertices with high centrality. Expand
Identifying high betweenness centrality nodes in large social networks
Experimental evaluations on real and synthetic social networks show improved accuracy in detecting high betweenness centrality nodes and significantly reduced execution time when compared with existing randomized algorithms. Expand
Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks
Numerical simulations on various randomly generated networks reveal that it is feasible to use the proposed algorithm in large network analysis, and considerable time can be saved with the proposed algorithms when , indicating that it can be suitable for lightly weighted large sparse networks. Expand
Fast Approximations of Betweenness Centrality with Graph Neural Networks
This paper presents a Graph Neural Network based inductive framework which uses constrained message passing of node features to approximate betweenness centrality, and is the first to propose a GNN based model to accomplish this task. Expand
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. Expand
A Fast Algorithm for Streaming Betweenness Centrality
  • Oded Green, R. McColl, David A. Bader
  • Mathematics, Computer Science
  • 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
  • 2012
This work gives a novel algorithm that reduces computation for the insertion of an edge into the graph, the first algorithm for the computation of betweenness centrality in a streaming graph. Expand
A random projection approach for estimation of the betweenness centrality measure
Applying random projection approach, an approximation algorithm for computing betweenness centrality of a given node, is proposed in this paper, for both weighted and unweighted graphs and it is proved that the proposed method works better than the existing methods to approximate the betweennesscentrality measure. Expand
Space Efficient Incremental Betweenness Algorithm for Directed Graphs
  • Reynaldo Gil-Pons
  • Computer Science
  • Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
  • 2019
This work proposes a new incremental algorithm to compute the betweenness centrality of all nodes in directed graphs extracted from social networks using linear space, making it suitable for large scale applications. Expand
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 experimentally speeds up the calculation of betweennesscentrality from 7 to 412 times, for real graphs, in comparison to the currently best known technique. Expand
Incremental algorithms for closeness centrality
The proposed algorithms efficiently compute the closeness centrality values upon changes in network topology, i.e., edge insertions and deletions, and are efficient on many real-life networks, especially on small-world networks, which have a small diameter and spike-shaped shortest distance distribution. Expand


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. Expand
Theoretical Foundations for Centrality Measures
Three measures of actors' network centrality are derived from an elementary rocess model of social influence. The measures are closely related to, and cast new light on, widely used measures ofExpand
Eccentricity and centrality in networks
Abstract The classic concept of centrality discovered by Camille Jordan in the 19th century is introduced as a model for social network analysis. It is generalized to include the path center of aExpand
Centrality in social networks conceptual clarification
Abstract The intuitive background for measures of structural centrality in social networks is reviewed and existing measures are evaluated in terms of their consistency with intuitions and theirExpand
Integration and radiality: Measuring the extent of an individual's connectedness and reachability in a network
Abstract This paper presents two measures, integration and radiality, which indicate the degree an individual is connected and reachable within a network. The measures are created using a reverseExpand
Semirings for social networks analysis
In the paper four semirings for solving social networks problems are constructed. The closure of relational matrix over geodetic semirings contains for every pair of vertices u and v the length andExpand
Pajek - Program for Large Network Analysis
Some approaches to analysis and visualisation of large networks implemented in programPajek are presented and some typical examples are also given. Expand
The Web as a Graph: Measurements, Models, and Methods
This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet. Expand
The gatekeeper, pair-dependency and structural centrality
This is a note to introduce a new measure of a kind of structural centrality called pair-dependency. Pair-dependency explicates the centrality-related notion of the gatekeeper. Moreover, it turns outExpand
Improved algorithms for topic distillation in a hyperlinked environment
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic, by augmenting a previous connectivity analysis based algorithm with content analysis. Expand