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

FOCS

2006

IEEE

2006

IEEE

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 an algorithm for local graph partitioning using personalized PageRank vectors. We develop an improved algorithm for computing approximate PageRank vectors, and derive a mixing result for PageRank vectors similar to that for random walks. Using this mixing result, we derive an analogue of the Cheeger inequality for PageRank, which shows that a sweep over a single PageRank vector can ﬁnd a cut with conductance φ, provided there exists a cut with conductance at most f(φ), where f(φ) is Ω(φ2 / log m), and where m is the number of edges in the graph. By extending this result to approximate PageRank vectors, we develop an algorithm for local graph partitioning that can be used to a ﬁnd a cut with conductance at most φ, whose small side has volume at...

Related Content

Added |
11 Jun 2010 |

Updated |
11 Jun 2010 |

Type |
Conference |

Year |
2006 |

Where |
FOCS |

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

Comments (0)