Abstract
Heat kernel pagerank is a variation of Personalized PageRank given in an exponential formulation. In this work, we present a sublinear time algorithm for approximating the heat kernel pagerank of a graph. The algorithm works by simulating random walks of bounded length and runs in time \(O\big (\frac{\log (\epsilon ^{-1})\log n}{\epsilon ^3\log \log (\epsilon ^{-1})}\big )\), assuming performing a random walk step and sampling from a distribution with bounded support take constant time.
The quantitative ranking of vertices obtained with heat kernel pagerank can be used for local clustering algorithms. We present an efficient local clustering algorithm that finds cuts by performing a sweep over a heat kernel pagerank vector, using the heat kernel pagerank approximation algorithm as a subroutine. Specifically, we show that for a subset S of Cheeger ratio \(\phi \), many vertices in S may serve as seeds for a heat kernel pagerank vector which will find a cut of conductance \(O(\sqrt{\phi })\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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)
Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: IEEE 47th Annual Symposium on Foundations of Computer Science, pp. 475–486. IEEE (2006)
Andersen, R., Peres, Y.: Finding sparse cuts locally using evolving sets. In: Proceedings of the 41st Annual Symposium on Theory of Computing, pp. 235–244. ACM (2009)
Borgs, C., Brautbar, M., Chayes, J., Teng, S.-H.: A sublinear time algorithm for pagerank computations. In: Bonato, A., Janssen, J. (eds.) WAW 2012. LNCS, vol. 7323, pp. 41–53. Springer, Heidelberg (2012)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1), 107–117 (1998)
Chung, F.: The heat kernel as the pagerank of a graph. Proc. Natl. Acad. Sci. 104(50), 19735–19740 (2007)
Chung, F.: A local graph partitioning algorithm using heat kernel pagerank. Internet Math. 6(3), 315–330 (2009)
Chung, F., Simpson, O.: Solving linear systems with boundary conditions using heat kernel pagerank. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 203–219. Springer, Heidelberg (2013)
Gharan, S.O., Trevisan, L.: Approximating the expansion profile and almost optimal local graph clustering. In: IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 187–196. IEEE (2012)
Kannan, R., Vempala, S., Vetta, A.: On clusterings: good, bad and spectral. J. ACM (JACM) 51(3), 497–515 (2004)
Kloster, K., Gleich, D.F.: A nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 68–79. Springer, Heidelberg (2013)
Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th International Conference on World Wide Web, pp. 695–704. ACM (2008)
Lin, F., Cohen, W.W.: Power iteration clustering. In: Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 655–662 (2010)
Lin, F., Cohen, W.W.: A very fast method for clustering big text datasets. In: Proceedings of the 19th European Conference on Artificial Intelligence, pp. 303–308 (2010)
Lovász, L., Simonovits, M.: The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 346–354. IEEE (1990)
Lovász, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms 4(4), 359–412 (1993)
Ng, A.Y., Jordan, M.I., Weiss, Y., et al.: On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Proc. Syst. 2, 849–856 (2002)
Orecchia, L., Sachdeva, S., Vishnoi, N.K.: Approximating the exponential, the lanczos method and an \(\tilde{O}\)(m)-time spectral algorithm for balanced separator. In: Proceedings of the 44th Symposium on Theory of Computing, pp. 1141–1160. ACM (2012)
Sachdeva, S., Vishnoi, N.K.: Matrix inversion is as easy as exponentiation (2013). arXiv preprint arXiv:1305.0526
Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the thirty-sixth annual ACM symposium on Theory of Computing, pp. 81–90. ACM (2004)
Spielman, D.A., Teng, S.H.: A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR abs/0809.3232 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chung, F., Simpson, O. (2015). Computing Heat Kernel Pagerank and a Local Clustering Algorithm. In: Jan, K., Miller, M., Froncek, D. (eds) Combinatorial Algorithms. IWOCA 2014. Lecture Notes in Computer Science(), vol 8986. Springer, Cham. https://doi.org/10.1007/978-3-319-19315-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-19315-1_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19314-4
Online ISBN: 978-3-319-19315-1
eBook Packages: Computer ScienceComputer Science (R0)