HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Quasi-stationary distributions as centrality measures of reducible graphs

Abstract : Random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visit the rest of the graph. In Google PageRank the problem was solved by introduction of uniform random jumps with some probability. Up to the present, there is no clear criterion for the choice this parameter. We propose to use parameter-free centrality measure which is based on the notion of quasi-stationary distribution. Specifically we suggest four quasi-stationary based centrality measures, analyze them and conclude that they produce approximately the same ranking. The new centrality measures can be applied in spam detection to detect ``link farms'' and in image search to find photo albums.
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, August 8, 2007 - 10:32:02 AM
Last modification on : Thursday, January 20, 2022 - 5:27:38 PM
Long-term archiving on: : Tuesday, September 21, 2010 - 1:56:55 PM


Files produced by the author(s)


  • HAL Id : inria-00166333, version 2
  • ARXIV : 0708.0522



Konstantin Avrachenkov, Vivek Borkar, Danil Nemirovsky. Quasi-stationary distributions as centrality measures of reducible graphs. [Research Report] RR-6263, INRIA. 2007, pp.19. ⟨inria-00166333v2⟩



Record views


Files downloads