Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

IM

2007

2007

A local graph partitioning algorithm ﬁnds a cut near a speciﬁed starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than the size of the input graph. In this paper, we present a local partitioning algorithm using a variation of PageRank with a speciﬁed starting distribution. We derive a mixing result for PageRank vectors similar to that for random walks, and show that the ordering of the vertices produced by a PageRank vector reveals a cut with small conductance. In particular, we show that for any set C with conductance Φ and volume k, a PageRank vector with a certain starting distribution can be used to produce a set with conductance O( √ Φ log k). We present an improved algorithm for computing approximate PageRank vectors, which allows us to ﬁnd such a set in time proportional to its size. In particular, we can ﬁnd a cut with conductance at most φ, whose small side has volume at least 2b , in time O(2b log2 m/φ2...

Related Content

Added |
15 Dec 2010 |

Updated |
15 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
IM |

Authors |
Reid Andersen, Fan R. K. Chung, Kevin J. Lang |

Comments (0)