A local graph partitioning algorithm using heat kernel pagerank

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

Volumn 5427 LNCS, Issue , 2009, Pages 62-75

  Chung, Fan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AXIAL FLOW;

GRAPH PARTITIONING ALGORITHMS; HEAT KERNELS; PAGE RANKS; PARTITIONING ALGORITHMS;

MATHEMATICAL MODELS;

EID: 61649122201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-95995-3_6     Document Type: Conference Paper

References (20)

1. Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: Proceedings of the 47th Annual IEEE Symposium on Founation of Computer Science (FOCS 2006), pp. 475-486 (2006)
2. Andersen, R., Chung, F.: Detecting sharp drops in pageRank and a simplified local partitioning algorithm. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 1-12. Springer, Heidelberg (2007)
3. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107-117 (1998)
4. Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian. In: Gunning, R.C. (ed.) Problems in Analysis, pp. 195-199. Princeton Univ. Press, Princeton (1970)
5. Chung, F.: Spectral Graph Theory. AMS Publications (1997)
6. Chung, F.: Random walks and local cuts in graphs. LAA 423, 22-32 (2007)
7. Chung, F.: The heat kernel as the pagerank of a graph. PNAS 105(50), 19735-19740 (2007)
8. Chung, F., Oden, K.: Weighted graph Laplacians and isoperimetric inequalities. Pacific Journal of Mathematics 192, 257-273 (2000)
9. Chung, F., Yau, S.-T.: Coverings, heat kernels and spanning trees. Electronic Journal of Combinatorics 6, R12 (1999)
10. Chung, F., Lu, L.: Complex Graphs and Networks. In: CBMS Regional Conference Series in Mathematics, vol. 107, pp. viii+264. AMS Publications, RI (2006)
11. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9, 251-280 (1990)
12. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the theory of NP-completeness, pp. x+338. W.H. Freeman, San Francisco (1979)
13. Jerrum, M., Sinclair, A.J.: Approximating the permanent. SIAM J. Computing 18, 1149-1178 (1989)
14. Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, bad and spectral. JACM 51, 497-515 (2004)
15. Lovász, L., Simonovits, M.: The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume. In: 31st IEEE Annual Symposium on Foundations of Computer Science, pp. 346-354 (1990)
16. Lovász, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Structures and Algorithms 4, 359-412 (1993)
17. Mihail, M.: Conductance and Convergence of Markov Chains: A Combinatorial treatment of Expanders. In: FOCS, pp. 526-531 (1989)
18. Perron, O.: Theorie der algebraischen Gleichungen, II (zweite Auflage), de Gruyter, Berlin (1933)
19. Spielman, D., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsiflcation, and solving linear systems. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 81-90 (2004)
20. Schoen, R.M., Yau, S.T.: Differential Geometry. International Press, Cambridge (1994)