Bonacich centrality measures the number of attenuated paths between nodes in a network. We use this metric to study network structure, specifically, to rank nodes and find community structure of the network. To this end we extend the modularity-maximization method for community detection to use this centrality metric as a measure of node connectivity. Bonacich centrality contains a tunable parameter that sets the length scale of interactions. By studying how rankings and discovered communities change when this parameter is varied allows us to identify globally important nodes and structures. We apply the proposed method to several benchmark networks and show that it leads to better insight into network structure than earlier methods.
[1]
Karl Rihaczek,et al.
1. WHAT IS DATA MINING?
,
2019,
Data Mining for the Social Sciences.
[2]
VoLUME Xxxix,et al.
THE AMERICAN JOURNAL OF SOCIOLOGY
,
2010
.
[3]
Diederich Hinrichsen,et al.
Mathematical Systems Theory I
,
2006,
IEEE Transactions on Automatic Control.
[4]
A. Châtelain,et al.
The European Physical Journal D
,
1999
.
[5]
October I.
Physical Review Letters
,
2022
.
[6]
Ian Witten,et al.
Data Mining
,
2000
.
[7]
O. William.
Journal Of The American Statistical Association V-28
,
1932
.