Absorbing Random Walks Interpolating Between Centrality Measures on Complex Networks
arXiv:1904.05790 · doi:10.1103/PhysRevE.101.012302
Abstract
Centrality, which quantifies the "importance" of individual nodes, is among the most essential concepts in modern network theory. As there are many ways in which a node can be important, many different centrality measures are in use. Here, we concentrate on versions of the common betweenness and it closeness centralities. The former measures the fraction of paths between pairs of nodes that go through a given node, while the latter measures an average inverse distance between a particular node and all other nodes. Both centralities only consider shortest paths (i.e., geodesics) between pairs of nodes. Here we develop a method, based on absorbing Markov chains, that enables us to continuously interpolate both of these centrality measures away from the geodesic limit and toward a limit where no restriction is placed on the length of the paths the walkers can explore. At this second limit, the interpolated betweenness and closeness centralities reduce, respectively, to the well-known it current betweenness and resistance closeness (information) centralities. The method is tested numerically on four real networks, revealing complex changes in node centrality rankings with respect to the value of the interpolation parameter. Non-monotonic betweenness behaviors are found to characterize nodes that lie close to inter-community boundaries in the studied networks.
References in corpus (18)
- Statistical mechanics of complex networks
- Lethality and centrality in protein networks
- Efficient Behavior of Small-World Networks
- Cooperative Game Theory Approaches for Network Partitioning
- Who is the best connected scientist? A study of scientific coauthorship networks
- Critical phenomena in complex networks
- Communicability in complex networks
- Communicability Betweenness in Complex Networks
- Two betweenness centrality measures based on Randomized Shortest Paths
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- A bag-of-paths framework for network data analysis
- Dynamic Networks that Drive the Process of Irreversible Step-Growth Polymerization
- Architecture of the Florida Power Grid as a Complex Network
- Floridian high-voltage power-grid network partitioning and cluster optimization using simulated annealing
- Quantifying non-monotonicity of functions and the lack of positivity in signed measures
- Spectral matrix methods for partitioning power grids: Applications to the Italian and Floridian high-voltage networks
- Ensemble Distribution for Immiscible Two-Phase Flow in Porous Media
- Centrality Fingerprints for Power Grid Network Growth Models