Betweenness Centrality of Sets of Vertices in Graphs: Which Vertices to Associate

Cristina Maier; Dan Simovici

doi:10.1145/3404663.3404679

Betweenness Centrality of Sets of Vertices in Graphs: Which Vertices to Associate

Cristina Maier
, Dan Simovici

Computer Science

University of Massachusetts Boston

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Betweenness centrality of a set of vertices can be seen as a measure of the control of flow of information that the set has within a network. We introduce the notion of saturated betweenness centrality set, which is defined as a set whose betweenness centrality will not increase by adding more members, but will decrease if any of its members is removed. We examine various properties of saturated betweenness centrality sets. These findings allow us to introduce an algorithm to optimally detect associations with high control of flow of information.

Original language	English
Title of host publication	Proceedings of the 2020 4th International Conference on Information System and Data Mining, ICISDM 2020
Publisher	Association for Computing Machinery
Pages	20-24
Number of pages	5
ISBN (Electronic)	9781450377652
DOIs	https://doi.org/10.1145/3404663.3404679
State	Published - May 15 2020
Event	4th International Conference on Information System and Data Mining, ICISDM 2020 - Hilo, United States Duration: May 15 2020 → May 17 2020

Publication series

Name	ACM International Conference Proceeding Series

Conference

Conference	4th International Conference on Information System and Data Mining, ICISDM 2020
Country/Territory	United States
City	Hilo
Period	5/15/20 → 5/17/20

ASJC Scopus Subject Areas

Software
Human-Computer Interaction
Computer Vision and Pattern Recognition
Computer Networks and Communications

Keywords

control flow of information
graph mining
set betweenness centrality
social network

Access to Document

10.1145/3404663.3404679

Cite this

Betweenness Centrality of Sets of Vertices in Graphs: Which Vertices to Associate. / Maier, Cristina; Simovici, Dan.
Proceedings of the 2020 4th International Conference on Information System and Data Mining, ICISDM 2020. Association for Computing Machinery, 2020. p. 20-24 (ACM International Conference Proceeding Series).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Maier, C & Simovici, D 2020, Betweenness Centrality of Sets of Vertices in Graphs: Which Vertices to Associate. in Proceedings of the 2020 4th International Conference on Information System and Data Mining, ICISDM 2020. ACM International Conference Proceeding Series, Association for Computing Machinery, pp. 20-24, 4th International Conference on Information System and Data Mining, ICISDM 2020, Hilo, United States, 5/15/20. https://doi.org/10.1145/3404663.3404679

@inproceedings{00511c0125bc42309bc2c166981fb140,

title = "Betweenness Centrality of Sets of Vertices in Graphs: Which Vertices to Associate",

abstract = "Betweenness centrality of a set of vertices can be seen as a measure of the control of flow of information that the set has within a network. We introduce the notion of saturated betweenness centrality set, which is defined as a set whose betweenness centrality will not increase by adding more members, but will decrease if any of its members is removed. We examine various properties of saturated betweenness centrality sets. These findings allow us to introduce an algorithm to optimally detect associations with high control of flow of information.",

keywords = "control flow of information, graph mining, set betweenness centrality, social network",

author = "Cristina Maier and Dan Simovici",

note = "Publisher Copyright: {\textcopyright} 2020 ACM.; 4th International Conference on Information System and Data Mining, ICISDM 2020 ; Conference date: 15-05-2020 Through 17-05-2020",

year = "2020",

month = may,

day = "15",

doi = "10.1145/3404663.3404679",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

pages = "20--24",

booktitle = "Proceedings of the 2020 4th International Conference on Information System and Data Mining, ICISDM 2020",

}

TY - GEN

T1 - Betweenness Centrality of Sets of Vertices in Graphs

T2 - 4th International Conference on Information System and Data Mining, ICISDM 2020

AU - Maier, Cristina

AU - Simovici, Dan

PY - 2020/5/15

Y1 - 2020/5/15

N2 - Betweenness centrality of a set of vertices can be seen as a measure of the control of flow of information that the set has within a network. We introduce the notion of saturated betweenness centrality set, which is defined as a set whose betweenness centrality will not increase by adding more members, but will decrease if any of its members is removed. We examine various properties of saturated betweenness centrality sets. These findings allow us to introduce an algorithm to optimally detect associations with high control of flow of information.

AB - Betweenness centrality of a set of vertices can be seen as a measure of the control of flow of information that the set has within a network. We introduce the notion of saturated betweenness centrality set, which is defined as a set whose betweenness centrality will not increase by adding more members, but will decrease if any of its members is removed. We examine various properties of saturated betweenness centrality sets. These findings allow us to introduce an algorithm to optimally detect associations with high control of flow of information.

KW - control flow of information

KW - graph mining

KW - set betweenness centrality

KW - social network

UR - https://www.scopus.com/pages/publications/85092433101

UR - https://www.scopus.com/pages/publications/85092433101#tab=citedBy

U2 - 10.1145/3404663.3404679

DO - 10.1145/3404663.3404679

M3 - Conference contribution

AN - SCOPUS:85092433101

T3 - ACM International Conference Proceeding Series

SP - 20

EP - 24

BT - Proceedings of the 2020 4th International Conference on Information System and Data Mining, ICISDM 2020

PB - Association for Computing Machinery

Y2 - 15 May 2020 through 17 May 2020

ER -

Betweenness Centrality of Sets of Vertices in Graphs: Which Vertices to Associate

Abstract

Publication series

Conference

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this