Multiscale Matrix Sampling and Sublinear-Time PageRank Computation

@article{Borgs2014MultiscaleMS,
  title={Multiscale Matrix Sampling and Sublinear-Time PageRank Computation},
  author={Christian Borgs and Mickey Brautbar and Jennifer T. Chayes and Shang-Hua Teng},
  journal={Internet Mathematics},
  year={2014},
  volume={10},
  pages={20-48}
}
A fundamental problem arising in many applications in Web science and social network analysis is the problem of identifying all nodes in a network whose PageRank exceeds a given threshold ∆. In this paper, we study the probabilistic version of the problem where given an arbitrary approximation factor c > 1, we are asked to output a set S of nodes such that with high probability, S contains all nodes of PageRank at least ∆, and no node of PageRank smaller than ∆/c. We call this problem… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

References

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

Local Graph Partitioning using PageRank Vectors

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) • 2006
View 10 Excerpts
Highly Influenced

Scaling personalized web search

View 7 Excerpts
Highly Influenced

Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search

T. H Haveliwala
In Trans. Knowl. Data Eng, • 2003
View 4 Excerpts
Highly Influenced

Sublinear Time Algorithms

Electronic Colloquium on Computational Complexity • 2011
View 2 Excerpts
Highly Influenced

Introduction to Testing Graph Properties

Property Testing • 2010
View 1 Excerpt
Highly Influenced

Similar Papers

Loading similar papers…