Establishes tight upper and lower bounds up to log n factors for estimating discounted random walk termination probabilities (Personalized PageRank) in directed graphs across all problem variants and query combinations in worst-case and average-case settings.
Efficient algorithms for approximate single-source personalized pagerank queries.ACM Trans
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Estimating Random-Walk Probabilities in Directed Graphs
Establishes tight upper and lower bounds up to log n factors for estimating discounted random walk termination probabilities (Personalized PageRank) in directed graphs across all problem variants and query combinations in worst-case and average-case settings.