Absorbing Random-Walk Centrality: Theory and Algorithms

@article{Mavroforakis2015AbsorbingRC,
  title={Absorbing Random-Walk Centrality: Theory and Algorithms},
  author={Charalampos Mavroforakis and M. Mathioudakis and A. Gionis},
  journal={2015 IEEE International Conference on Data Mining},
  year={2015},
  pages={901-906}
}
  • Charalampos Mavroforakis, M. Mathioudakis, A. Gionis
  • Published 2015
  • Computer Science
  • 2015 IEEE International Conference on Data Mining
  • 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 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… CONTINUE READING
    Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph
    Current Flow Group Closeness Centrality for Complex Networks?
    • 9
    • PDF
    Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations
    • 1
    • PDF
    Computer-assisted City Touring for Explorers
    Optimal Tagging with Markov Chain Optimization
    • 5
    • PDF
    Markov Chain Monitoring

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES
    Axioms for Centrality
    • 260
    • PDF
    Random walks on complex networks.
    • 743
    • PDF
    Cost-effective outbreak detection in networks
    • 1,887
    • PDF
    On query result diversification
    • 135
    • PDF
    Improving diversity in Web search results re-ranking using absorbing random walks
    • 8
    • Highly Influential
    The Anatomy of a Large-Scale Hypertextual Web Search Engine
    • 14,407
    • Highly Influential
    • PDF
    Efficient diversity-aware search
    • 115
    • PDF
    A set of measures of centrality based upon betweenness
    • 6,222
    A tutorial on spectral clustering
    • 6,873
    • PDF