Quick Detection of Top-k Personalized PageRank Lists

  title={Quick Detection of Top-k Personalized PageRank Lists},
  author={Konstantin Avrachenkov and Nelly Litvak and Danil Nemirovsky and Elena Smirnova and Marina Sokol},
We study a problem of quick detection of top-k Personalized PageRank (PPR) lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and person name disambiguation. We argue that two observations are important when finding top-k PPR lists. Firstly, it is crucial that we detect fast the top-k most important neighbors of a node, while the exact order in the top-k list and the exact values of PPR are by far not so… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS
25 Citations
20 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 25 extracted citations

56 Citations

Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 20 references

Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws

  • A. Gnedin, B. Hansen, J. Pitman
  • Probability Survyes, v.4,
  • 2007
Highly Influential
3 Excerpts

The exact joint distribution for the multinomial maximum and minimum and the exact distribution for the multinomial range

  • C. J. Corrado
  • SSRN Research Report,
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…