Absorbing random-walk centrality: Theory and algorithms
Authors:
Preprint
Abstract
We study a new notion of graph centrality based on absorbing random walks. Given a graph $G=(V,E)$ and a set of query nodes $Q\subseteq V$, we aim to identify the $k$ most central nodes in $G$ with respect to $Q$. Specifically, we consider central nodes to be absorbing for random walks that start at the query nodes $Q$. The goal is to find the set of $k$ central nodes that minimizes the expected length of a random walk until absorption. The proposed measure, which we call $k$ absorbing random-walk centrality, favors diverse sets, as it is beneficial to place the $k$ absorbing nodes in different parts of the graph so as to "intercept" random walks that start from different query nodes. Although similar problem definitions have been considered in the literature, e.g., in information-retrieval settings where the goal is to diversify web-search results, in this paper we study the problem formally and prove some of its properties. We show that the problem is NP-hard, while the objective function is monotone and supermodular, implying that a greedy algorithm provides solutions with an approximation guarantee. On the other hand, the greedy algorithm involves expensive matrix operations that make it prohibitive to employ on large datasets. To confront this challenge, we develop more efficient algorithms based on spectral clustering and on personalized PageRank.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Axioms for CentralityInternet Mathematics, 2014
- Exploring Network Structure, Dynamics, and Function using NetworkX2008
- Cost-effective outbreak detection in networks2007
- A Survey of Eigenvector Methods for Web Information RetrievalSIAM Review, 2005
- Random Walks on Complex NetworksPhysical Review Letters, 2004
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977
- Some effects of certain communication patterns on group performance.The Journal of Abnormal and Social Psychology, 1951