k-step betweenness centrality

Melda Kevser Akgün () and Mustafa Kemal Tural
Additional contact information
Melda Kevser Akgün: Ankara Yıldırım Beyazıt University
Mustafa Kemal Tural: Middle East Technical University

Computational and Mathematical Organization Theory, 2020, vol. 26, issue 1, No 3, 55-87

Abstract: Abstract The notions of betweenness centrality (BC) and group betweenness centrality (GBC) are widely used in social network analyses. We introduce variants of them; namely, the k-step BC and k-step GBC. The k-step GBC of a group of vertices in a network is a measure of the likelihood that at least one group member will get the information communicated between pairs of vertices through shortest paths within the first k steps of the start of the communication. The k-step GBC of a single vertex is the k-step BC of that vertex. The introduced centrality measures may find uses in applications where it is important or critical to obtain the information within a fixed time of the start of the communication. For the introduced centrality measures, we propose an algorithm that can compute successively the k-step GBC of several groups of vertices. The performance of the proposed algorithm is evaluated through computational experiments. The use of the new BC measures leads to an earlier control of the information (virus, malware, or rumor) before it spreads through the network.

Keywords: Betweenness; Centrality; Group betweenness; Network analysis; Social networks; k-step betweenness (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10588-019-09301-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comaot:v:26:y:2020:i:1:d:10.1007_s10588-019-09301-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10588

DOI: 10.1007/s10588-019-09301-9

Access Statistics for this article

Computational and Mathematical Organization Theory is currently edited by Terrill Frantz and Kathleen Carley

More articles in Computational and Mathematical Organization Theory from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().