Quasi-stationary distributions as centrality measures of reducible graphs

Konstantin Avrachenkov, Vivek Borkar, Danil Nemirovsky

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 visi…