8 citations · 8 across the 3 of their papers we have counts for
Showing cs.NIShow all
2 papers · 1 filter
cs.NI2010★ 8 cited
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
Konstantin Avrachenkov, Nelly Litvak, Danil A. Nemirovsky +2
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimati…
cs.NI2007
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…