Estimating PageRank on graph streams
作者： Atish Das Sarma , Sreenivas Gollapudi , Rina Panigrahy
关键词:
摘要: … to estimate the mixing time. In this article we provide algorithms on a graph stream for the … We will provide a streaming algorithm to estimate the steady state distribution of a random …
acm.org
core.ac.uk
stanford.edu 
sci-hub.se 参考文章(30)
Andrew McGregor, Sudipto Guha, Space-Efficient Sampling international conference on artificial intelligence and statistics. pp. 171- 178 ,(2007)
T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubinfeld, P. White, Testing random variables for independence and identity international conference on cluster computing. pp. 442- 451 ,(2001) , 10.1109/SFCS.2001.959920
Andrew McGregor, Finding Graph Matchings in Data Streams Lecture Notes in Computer Science. pp. 170- 181 ,(2005) , 10.1007/11538462_15
Sudipto Guha, Andrew McGregor, Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming Automata, Languages and Programming. pp. 704- 715 ,(2007) , 10.1007/978-3-540-73420-8_61
Hossein Jowhari, Mohammad Ghodsi, New streaming algorithms for counting triangles in graphs computing and combinatorics conference. pp. 710- 716 ,(2005) , 10.1007/11533719_72
Lakshminath Bhuvanagiri, Sumit Ganguly, Estimating Entropy over Data Streams Lecture Notes in Computer Science. pp. 148- 159 ,(2006) , 10.1007/11841036_16
Sridhar Rajagopalan, Prabhakar Raghavan, Monika R. Henzinger, Computing on data streams External memory algorithms. pp. 107- 118 ,(1999)
Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou, SL ⊆L4/3 symposium on the theory of computing. pp. 230- 239 ,(1997) , 10.1145/258533.258593
Uriel Feige, A Spectrum of Time-Space Trade-offs for Undirecteds-tConnectivity foundations of computer science. ,vol. 54, pp. 305- 316 ,(1997) , 10.1006/JCSS.1997.1471
Ziv Bar-Yossef, D. Sivakumar, Ravi Kumar, Reductions in streaming algorithms, with an application to counting triangles in graphs symposium on discrete algorithms. pp. 623- 632 ,(2002) , 10.5555/545381.545464