Local partitioning for directed graphs using pagerank

Internet Mathematics

Volumn 5, Issue 1-2, 2008, Pages 3-22

  Andersen, Reid ^a   Chung, Fan ^b   Lang, Kevin ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80051666179     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2008.10129297     Document Type: Article

References (16)

1. Reid Andersen, Fan Chung, and Kevin Lang. “Local Graph Partitioning Using PageRank Vectors.” In FOCS’06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06), pp. 475–486. Washington, DC: IEEE Computer Society, 2006.
2. Pavel Berkhin. “Bookmark-Coloring Algorithm for Personalized Page- Rank Computing.” Internet Math. 3:1 (2006), 41–62.
3. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. “Directed Metrics and Directed Graph Partitioning Problems.” In SODA’06: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 51–60. New York: ACM Press, 2006.
4. F. Chung. Spectral Graph Theory, CBMS Regional Conference Series in Mathematics 92. Providence, RI: American Mathematical Society, 1997.
5. Fan Chung. “Laplacians and Cheeger Inequalities for Directed Graphs.” Annals of Combinatorics 9 (2005), 1–19.
6. Julia Chuzhoy and Sanjeev Khanna. “Hardness of Cut Problems in Directed Graphs.” In STOC’06: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 527–536. New York, ACM Press, 2006.
7. James Allen Fill. “Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process.” Ann. Appl. Probab. 1:1 (1991), 62–87.
8. David Gleich and Marzia Polito. “Approximating Personalized PageRank with Minimal Use of Web Graph Data.” Internet Mathematics 3:3 (2006), 257–294.
9. G. Golub and C. Greif. “Arnoldi-Type Algorithms for Computing Stationary Distribution Vectors, with Application to PageRank.” 10543 BIT Numerical Mathematics 46:4 (2006), 759–771.
10. Glen Jeh and Jennifer Widom. “Scaling Personalized Web Search.” In Proceedings of the 12th International Conference on World Wide Web, pp. 271–279. New York: ACM Press, 2003.
11. László Lovász and Miklós Simonovits. “The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume.” In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 346–354. Los Alamitos, CA: IEEE Press, 1990.
12. M. Mihail. “Conductance and Convergence of Markov Chains: A Combinatorial Treatment of Expanders.” In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 526–531. Los Alamitos, CA: IEEE Press
13. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. “The PageRank Citation Ranking: Bringing Order to the Web.” Technical report, Stanford Digital Library Technologies Project, 1998.
14. Tamás Sarlós, András A. Benczúr, Károly Csalogány, Dániel Fogaras, and Balázs Rácz. “To Randomize or Not to Randomize: Space Optimal Summaries for Hyperlink Analysis.” In Proceedings of the 12th International Conference on World Wide Web, pp. 297–306. New York: ACM Press, 2006.
15. Daniel A. Spielman and Shang-Hua Teng. “Spectral Partitioning Works: Planar Graphs and Finite Element Meshes.” In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 96–105. Los Alamitos, CA: IEEE Press, 1996.
16. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton: Princeton University Press, 1994.