Database Paper Browser

Back to papers

Estimating PageRank on Graph Streams

Summary: Streaming algorithms to estimate l-step random-walk distributions, mixing time and conductance using sublinear memory and few passes. Applies to PageRank: computes additive-ε approximations in sublinear space (e.g., Õ(n M^{-4/3})) and Õ(M^{4/3}) passes for mixing time M, outperforming the O(n)-space, O(M)-pass baseline when M is large. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1447
Venue
PODS
Year
2008
Pagerank
0.00019507721
Overall Rank
595 | 95.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers