Approximating betweenness centrality

David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail

Research output: Chapter in Book/Report/Conference proceedingConference contribution

152 Citations (Scopus)

Abstract

Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently the fastest-known algorithm by Brandes requires O(nm) time for unweighted graphs and O(nm + n2 log n) time for weighted graphs, where n is the number of vertices and m is the number of edges in the network. These are also the worstcase time bounds for computing the betweenness score of a single vertex. In this paper, we present a novel approximation algorithm for computing betweenness centrality of a given vertex, for both weighted and unweighted graphs. Our approximation algorithm is based on an adaptive sampling technique that significantly reduces the number of single-source shortest path computations for vertices with high centrality. We conduct an extensive experimental study on real-world graph instances, and observe that our random sampling algorithm gives very good betweenness approximations for biological networks, road networks and web crawls.

Original languageEnglish (US)
Title of host publicationAlgorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings
Pages124-137
Number of pages14
Volume4863 LNCS
StatePublished - 2007
Event5th Workshop on Algorithms and Models for the Web-Graph, WAW 2007 - San Diego, CA, United States
Duration: Dec 11 2007Dec 12 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4863 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Workshop on Algorithms and Models for the Web-Graph, WAW 2007
CountryUnited States
CitySan Diego, CA
Period12/11/0712/12/07

Fingerprint

Betweenness
Centrality
Approximation algorithms
Sampling
Complex networks
Electric network analysis
Shortest path
Approximation Algorithms
Graph in graph theory
Adaptive Sampling
Random Sampling
Computing
Complex Analysis
Biological Networks
Road Network
Network Analysis
Weighted Graph
Vertex of a graph
Complex Networks
Fast Algorithm

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bader, D. A., Kintali, S., Madduri, K., & Mihail, M. (2007). Approximating betweenness centrality. In Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings (Vol. 4863 LNCS, pp. 124-137). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4863 LNCS).
Bader, David A. ; Kintali, Shiva ; Madduri, Kamesh ; Mihail, Milena. / Approximating betweenness centrality. Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings. Vol. 4863 LNCS 2007. pp. 124-137 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d5aa41b7a752473ea7fa99c451ab737d,
title = "Approximating betweenness centrality",
abstract = "Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently the fastest-known algorithm by Brandes requires O(nm) time for unweighted graphs and O(nm + n2 log n) time for weighted graphs, where n is the number of vertices and m is the number of edges in the network. These are also the worstcase time bounds for computing the betweenness score of a single vertex. In this paper, we present a novel approximation algorithm for computing betweenness centrality of a given vertex, for both weighted and unweighted graphs. Our approximation algorithm is based on an adaptive sampling technique that significantly reduces the number of single-source shortest path computations for vertices with high centrality. We conduct an extensive experimental study on real-world graph instances, and observe that our random sampling algorithm gives very good betweenness approximations for biological networks, road networks and web crawls.",
author = "Bader, {David A.} and Shiva Kintali and Kamesh Madduri and Milena Mihail",
year = "2007",
language = "English (US)",
isbn = "9783540770039",
volume = "4863 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "124--137",
booktitle = "Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings",

}

Bader, DA, Kintali, S, Madduri, K & Mihail, M 2007, Approximating betweenness centrality. in Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings. vol. 4863 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4863 LNCS, pp. 124-137, 5th Workshop on Algorithms and Models for the Web-Graph, WAW 2007, San Diego, CA, United States, 12/11/07.

Approximating betweenness centrality. / Bader, David A.; Kintali, Shiva; Madduri, Kamesh; Mihail, Milena.

Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings. Vol. 4863 LNCS 2007. p. 124-137 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4863 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Approximating betweenness centrality

AU - Bader, David A.

AU - Kintali, Shiva

AU - Madduri, Kamesh

AU - Mihail, Milena

PY - 2007

Y1 - 2007

N2 - Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently the fastest-known algorithm by Brandes requires O(nm) time for unweighted graphs and O(nm + n2 log n) time for weighted graphs, where n is the number of vertices and m is the number of edges in the network. These are also the worstcase time bounds for computing the betweenness score of a single vertex. In this paper, we present a novel approximation algorithm for computing betweenness centrality of a given vertex, for both weighted and unweighted graphs. Our approximation algorithm is based on an adaptive sampling technique that significantly reduces the number of single-source shortest path computations for vertices with high centrality. We conduct an extensive experimental study on real-world graph instances, and observe that our random sampling algorithm gives very good betweenness approximations for biological networks, road networks and web crawls.

AB - Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently the fastest-known algorithm by Brandes requires O(nm) time for unweighted graphs and O(nm + n2 log n) time for weighted graphs, where n is the number of vertices and m is the number of edges in the network. These are also the worstcase time bounds for computing the betweenness score of a single vertex. In this paper, we present a novel approximation algorithm for computing betweenness centrality of a given vertex, for both weighted and unweighted graphs. Our approximation algorithm is based on an adaptive sampling technique that significantly reduces the number of single-source shortest path computations for vertices with high centrality. We conduct an extensive experimental study on real-world graph instances, and observe that our random sampling algorithm gives very good betweenness approximations for biological networks, road networks and web crawls.

UR - http://www.scopus.com/inward/record.url?scp=38149071742&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149071742&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149071742

SN - 9783540770039

VL - 4863 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 124

EP - 137

BT - Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings

ER -

Bader DA, Kintali S, Madduri K, Mihail M. Approximating betweenness centrality. In Algorithms and Models for the Web-Graph - 5th International Workshop, WAW 2007, Proceedings. Vol. 4863 LNCS. 2007. p. 124-137. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).