Local partitioning for directed graphs using PageRank

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4863 LNCS, Issue , 2007, Pages 166-178

  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

ALGORITHMS; MARKOV PROCESSES; VECTORS;

ARBITRARY DIRECTED GRAPHS; CONDUCTANCE FUNCTIONS; PAGERANK MARKOV CHAIN;

GRAPH THEORY;

EID: 38149129496     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77004-6_13     Document Type: Conference Paper

References (16)

1. Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475-486. IEEE Computer Society, Washington, DC (2006)
2. Berkhin, P.: Bookmark-coloring algorithm for personalized PageRank computing. Internet Math. 3(1), 41-62 (2006)
3. Charikar, M., Makarychev, K., Makarychev, Y.: Directed metrics and directed graph partitioning problems. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 51-60. ACM Press, New York (2006)
4. Chung, F.: Spectral graph theory. In: CBMS Regional Conference Series in Mathematics, vol. 92, American Mathematical Society, Providence (1997)
5. Chung, F.: Laplacians and Cheeger inequalities for directed graphs. Annals of Combinatorics 9, 1-19 (2005)
6. Chuzhoy, J., Khanna, S.: Hardness of cut problems in directed graphs. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 527-536. ACM Press, New York (2006)
7. Fill, J.A.: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1(1), 62-87 (1991)
8. Gleich, D., Polito, M.: Approximating personalized PageRank with minimal use of webgraph data. Internet Mathematics (to appear)
9. Golub, C., Greif, C.: Arnoldi-type algorithms for computing stationary distribution vectors, with application to PageRank. 10543 BIT Numerical Mathematics 46(4) (2006)
10. Jeh, C., Widom, J.: Scaling personalized web search. In: WWW 2003. Proceedings of the 12th World Wide Web Conference, pp. 271-279 (2003)
11. Lovász, L., Simonovits, M.: The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In: FOCS, pp. 346-354 (1990)
12. Mihail, M.: Conductance and convergence of markov chains - a combinatorial treatment of expanders. In: Proc. of 30th FOCS, pp. 526-531 (1989)
13. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
14. Sarlós, T., Benczúr, A.A., Csalogány, K., Fogaras, D.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW, pp. 297-306 (2006)
15. Spielman, D.A., Teng, S.-H.: Spectral partitioning works: Planar graphs and finite element meshes. In: IEEE Symposium on Foundations of Computer Science, pp. 96-105 (1996)
16. Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press (1994)