A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank

  • Fan Chung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5427)

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|}\).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Fan Chung
    • 1
  1. 1.University of California at San DiegoLa JollaUSA

Personalised recommendations