A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank

Authors:
Fan Chung
Affiliations:
University of California at San Diego, La Jolla, USA CA 92093
Venue:
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Year:
2009

Citing 11
Cited 0

Approximating the permanent

SIAM Journal on Computing
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On clusterings: Good, bad and spectral

Journal of the ACM (JACM)
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Local Graph Partitioning using PageRank Vectors

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)

Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)
Conductance and convergence of Markov chains-a combinatorial treatment of expanders

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Detecting sharp drops in PageRank and a simplified local partitioning algorithm

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h , we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead to local cuts with Cheeger ratio at most $O(\sqrt{h})$, improving the previously bound by a factor of $\sqrt{log|S|}$.