Skip to main content
SpringerLink
Log in

A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank

  • Conference paper
Algorithms and Models for the Web-Graph (WAW 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5427))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Google Scholar 

  5. Chung, F.: Spectral Graph Theory. AMS Publications (1997)

    Google Scholar 

  6. Chung, F.: Random walks and local cuts in graphs. LAA 423, 22–32 (2007)

    MathSciNet  MATH  Google Scholar 

  7. Chung, F.: The heat kernel as the pagerank of a graph. PNAS 105(50), 19735–19740 (2007)

    Article  Google Scholar 

  8. Chung, F., Oden, K.: Weighted graph Laplacians and isoperimetric inequalities. Pacific Journal of Mathematics 192, 257–273 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chung, F., Yau, S.-T.: Coverings, heat kernels and spanning trees. Electronic Journal of Combinatorics 6, R12 (1999)

    MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  11. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9, 251–280 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  13. Jerrum, M., Sinclair, A.J.: Approximating the permanent. SIAM J. Computing 18, 1149–1178 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, bad and spectral. JACM 51, 497–515 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mihail, M.: Conductance and Convergence of Markov Chains: A Combinatorial treatment of Expanders. In: FOCS, pp. 526–531 (1989)

    Google Scholar 

  18. Perron, O.: Theorie der algebraischen Gleichungen, II (zweite Auflage). de Gruyter, Berlin (1933)

    Google Scholar 

  19. Spielman, D., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 81–90 (2004)

    Google Scholar 

  20. Schoen, R.M., Yau, S.T.: Differential Geometry. International Press, Cambridge (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California at San Diego, La Jolla, CA 92093, USA

    Fan Chung

Authors
  1. Fan Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Sophia Antipolis, 2004, 06902, Route des Lucioles, France

    Konstantin Avrachenkov

  2. Yahoo! Research, Barcelona Ocata 1, 1st floor, 08003, Barcelona Catalunya, Spain

    Debora Donato

  3. Dept. of Applied Mathematics, University of Twente, P.O. Box 217, 7500AE, Enschede, The Netherlands

    Nelly Litvak

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chung, F. (2009). A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank. In: Avrachenkov, K., Donato, D., Litvak, N. (eds) Algorithms and Models for the Web-Graph. WAW 2009. Lecture Notes in Computer Science, vol 5427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95995-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95995-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-95994-6

  • Online ISBN: 978-3-540-95995-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation