pith. sign in

arxiv: 0911.1095 · v1 · submitted 2009-11-05 · ⚛️ physics.soc-ph

Parameterized Centrality for Network Analysis

classification ⚛️ physics.soc-ph
keywords networkcentralitynodesstructurebonacichcommunitymethodmetric
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.