80 citations · 87 across the 2 of their papers we have counts for
1 paper · 1 filter
Charalampos Mavroforakis, Michael Mathioudakis, Aristides Gionis
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⊆V, we aim to identify the k most central…