Estimating page rank on graph streams

Journal of the ACM

Volumn 58, Issue 3, 2011, Pages

  Sarma, Atish Das ^a   Gollapudi, Sreenivas ^b   Panigrahy, Rina ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Algorithms; Graph conductance; Mixing time; Page rank; Random walk; Streaming algorithms

Indexed keywords

GRAPH CONDUCTANCE; MIXING TIME; PAGE RANKS; RANDOM WALK; STREAMING ALGORITHMS;

ALGORITHMS; ESTIMATION; RANDOM PROCESSES; USER INTERFACES;

PROBABILITY DISTRIBUTIONS;

EID: 79960660763     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1970392.1970397     Document Type: Conference Paper

References (30)

1. ALON, N.,MATIAS, Y., AND SZEGEDY, M. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 1, 137-147.
2. ANDERSEN, R., CHUNG, F. R. K., AND LANG, K. J. 2006. Local graph partitioning using pagerank vectors. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS). 475-486.
3. 4/3. In Proceedings of the ACM Symposium on Theory of Computing. 230-239.
4. BAR-YOSSEF, Z., KUMAR, R., AND SIVAKUMAR, D. 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 623-632.
5. BATU, T., FISCHER, E., FORTNOW, L.,KUMAR, R.,RUBENFELD, R., ANDWHITE, P. 2001. Testing random variables for independence and identity. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS). 442-451. (Pubitemid 33068405)
6. BHUVANAGIRI, L., AND GANGULY, S. 2006. Estimating entropy over data streams. In Proceedings of the European Symposium on Algorithms (ESA). 148-159. (Pubitemid 44699648)
7. BHUVANAGIRI, L., GANGULY, S., KESH, D., AND SAHA, C. 2006. Simpler algorithm for estimating frequency moments of data streams. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 708-713. (Pubitemid 43275292)
8. BRIN, S., AND PAGE, L. 1998. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the 7th International Conference on World Wide Web. 107-117.
9. BURIOL, L. S., FRAHLING, G., LEONARDI, S., MARCHETTI-SPACCAMELA, A., AND SOHLE, C. 2006. Counting triangles in data streams. In Proceedings of the ACM SIFMOD-SICACT-SILANT Symposium on Principles of Database Systems. 253-262. (Pubitemid 46946487)
10. CORMODE, G., AND MUTHUKRISHNAN, S. 2005. Space efficient mining of multigraph streams. In Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). 271-282. (Pubitemid 43275489)
11. DEMETRESCU, C., FINOCCHI, I., AND RIBICHINI, A. 2006. Trading of space for passes in graph streaming problems. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). 714-723. (Pubitemid 43275293)
12. FEIGE, U. 1997. A spectrum of time-space trade-offs for undirected s-t connectivity. J. Comput. Syst. Sci. 54, 2, 305-316. (Pubitemid 127433375)
13. FEIGENBAUM, J., KANNAN, S., MCGREGOR, A., SURI, S., AND ZHANG, J. 2005. Graph distances in the streaming model: the value of space. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). 745-754. (Pubitemid 40851436)
14. FELDMAN, J., MUTHUKRISHNAN, S., SIDIROPOULOS, A., STEIN, C., AND SVITKINA, Z. 2006. On the complexity of processing massive, unordered, distributed data. In CoRR abs/cs/0611108.
15. GREENWALD, M., AND KHANNA, S. 2001. Space-efficient online computation of quantile summaries. In Proceedings of the ACM International Conference on Management of Data (SIGMOD). 58-66. (Pubitemid 32868990)
16. GUHA, S., AND MCGREGOR, A. 2006. Approximate quantiles and the order of the stream. In Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). 273-279. (Pubitemid 46950860)
17. GUHA, S., AND MCGREGOR, A. 2007a. Space-efficient sampling. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS). 169-176.
18. GUHA, S., AND MCGREGOR, A. 2007b. Lower bounds for quantile estimation in random-order and multi-pass streaming. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP). 704-715.
19. GUHA, S.,MCGREGOR, A., AND VENKATASUBRAMANIAN, S. 2006. Streaming and sublinear approximation of entropy and information distances. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). 733-742. (Pubitemid 43275295)
20. HENZINGER, M., RAGHAVAN, P., AND RAJAGOPALAN, S. 1999. Computing on data streams. In External Memory Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 50. 107-118.
21. INDYK, P. 2004. Algorithms for dynamic geometric problems over data streams. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 373-380.
22. INDYK, P., AND WOODRUFF, D. P. 2003. Optimal approximations of the frequency moments of data streams. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). 283-292.
23. JERRUM, M., AND SINCLAIR, A. 1989. Approximating the permanent. SIAM J. Computing 18, 6, 1149-1178. (Pubitemid 20613573)
24. JOWHARI, H., AND GHODSI,M. 2005. New streaming algorithms for counting triangles in graphs. In Proceedings of the 11th International Computing and Combinatories Conference (COCOON). 710-716. (Pubitemid 41450248)
25. MANKU, G., RAJAGOPALAN, S., AND LINDSAY, B. 1999. Randomized sampling techniques for space efficient online computation of order statistics of large datasets. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 251-262. (Pubitemid 129597340)
26. MCGREGOR, A. 2005. Finding graph matchings in data streams. In Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and 9th International Workshop on Randomization and Computation (RANDOM 2005). Lecture Notes in Computer Science, Vol. 3624, Springer, 170-181.
27. MCSHERRY, F. 2005. A uniform approach to accelerated pagerank computation. In Proceedings of the 14th International World Wide Web Conference (WWW). 575-582.
28. SARLOS, T., BENCZUR, A., CSALOGANY, K., FOGARAS, D., AND RACZ, B. 2006. To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In Proceedings of the the 15th International World Wide Web Conference (WWW). 297-306. (Pubitemid 46946622)
29. WICKS, J., AND GREENWALD, A. R. 2007. Parallelizing the computation of pagerank. In Proceedings of the 5th Workshop on Algorithms and Models for the Web-Graph (WAW). 202-208.
30. WOODRUFF, D. P. 2004. Optimal space lower bounds for all frequency moments'. In Proceedings of the ACMSIAM Symposium on Discrete Algorithms (SODA). 167-175.