A local graph partitioning algorithm using heat kernel pagerank

Internet Mathematics

Volumn 6, Issue 3, 2009, Pages 315-330

  Chung, Fan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84863020851     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2009.10390643     Document Type: Article

References (22)

1. R. Andersen, F. Chung, and K. Lang. “Local Graph Partitioning Using PageRank Vectors.” In Proceedings of the 47th Annual IEEE Symposium on Founation of Computer Science (FOCS’2006), pp. 475-486. Washington, DC: IEEE Computer Society, 2006.
2. R. Andersen, F. Chung, and K. Lang. “Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm.” In Theory and Applications of Models of Computation: 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, Lecture Notes in Computer Science 4484, pp. 1-12. Berlin: Springer, 2007.
3. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Computer Networks and ISDN Systems 30:1-7 (1998), 107-117.
4. J. Cheeger. “A Lower Bound for the Smallest Eigenvalue of the Laplacian.” In Problems in Analysis, edited by R. C. Gunning, pp. 195-199. Princeton: Princeton University Press, 1970.
5. F. Chung. Spectral Graph Theory, CBMS Regional Conference Series in Mathematics 92. Providence: American Mathematical Society, 1997.
6. F. Chung. “Random Walks and Local Cuts in Graphs.” LAA 423 (2007), 22-32.
7. F. Chung. “The Heat Kernel as the PageRank of a Graph.” PNAS 105:50 (2007), 19735-19740.
8. F. Chung and L. Lu. Complex Graphs and Networks, CBMS Regional Conference Series in Mathematics 107. Providence: American Mathematical Society, 2006.
9. F. Chung and K. Oden. “Weighted Graph Laplacians and Isoperimetric Inequalities.” Pacific Journal of Mathematics 192 (2000), 257-273.
10. F. Chung and S.-T. Yau. “Coverings, Heat Kernels and Spanning Trees.” Electronic Journal of Combinatorics 6 (1999), #R12.
11. D. Coppersmith and S. Winograd. “Matrix Multiplication via Arithmetic Progressions.” J. Symbolic Comput. 9 (1990), 251-280.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman, 1979.
13. T. H. Haveliwala. “Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search.” IEEE Trans. Knowl. Data Eng. 15:4 (2003), 784-796.
14. G. Jeh and J. Widom. “Scaling Personalized Web Search.” In Proceedings of the 12th International Conference on World Wide Web, pp. 271-279. New York: ACM, 2003.
15. M. Jerrum and A. J. Sinclair. “Approximating the Permanent.” SIAM J. Computing 18 (1989), 1149-1178.
16. R. Kannan, S. Vempala, and A. Vetta. “On Clusterings: Good, Bad and Spectral.” JACM 51 (2004), 497-515.
17. L. Lovász and M. 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. Washington, DC: IEEE Computer Society, 1990.
18. L. Lovász and M. Simonovits. Random Walks in a Convex Body and an Improved Volume Algorithm.” Random Structures and Algorithms 4 (1993), 359-412.
19. M. Mihail. “Conductance and Convergence of Markov Chains: A Combinatorial Treatment of Expanders.” FOCS (1989), 526-531.
20. O. Perron. Theorie der algebraischen Gleichungen, II (zweite Auflage). Berlin: de Gruyter, 1933.
21. R. M. Schoen and S. T. Yau. Differential Geometry. Cambridge, MA: International Press, 1994.
22. D. Spielman and S.-H. Teng. “Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems.” In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 81-90. New York: ACM, 2004.