8 citations · 8 across the 3 of their papers we have counts for
1 paper · 2 filters
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…