Abstract
A local partitioning algorithm finds a set with small conductance near a specified seed vertex. In this paper, we present a generalization of a local partitioning algorithm for undirected graphs to strongly connected directed graphs. In particular, we prove that by computing a personalized PageRank vector in a directed graph, starting from a single seed vertex within a set S that has conductance at most α, and by performing a sweep over that vector, we can obtain a set of vertices S′ with conductance \(\Phi_{M}(S')= O(\sqrt{\alpha \log |S|})\). Here, the conductance function Φ M is defined in terms of the stationary distribution of a random walk in the directed graph. In addition, we describe how this algorithm may be applied to the PageRank Markov chain of an arbitrary directed graph, which provides a way to partition directed graphs that are not strongly connected.
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
Preview
Unable to display preview. Download preview PDF.
References
Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475–486. IEEE Computer Society, Washington, DC (2006)
Berkhin, P.: Bookmark-coloring algorithm for personalized PageRank computing. Internet Math. 3(1), 41–62 (2006)
Charikar, M., Makarychev, K., Makarychev, Y.: Directed metrics and directed graph partitioning problems. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 51–60. ACM Press, New York (2006)
Chung, F.: Spectral graph theory. In: CBMS Regional Conference Series in Mathematics, vol. 92, American Mathematical Society, Providence (1997)
Chung, F.: Laplacians and Cheeger inequalities for directed graphs. Annals of Combinatorics 9, 1–19 (2005)
Chuzhoy, J., Khanna, S.: Hardness of cut problems in directed graphs. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 527–536. ACM Press, New York (2006)
Fill, J.A.: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1(1), 62–87 (1991)
Gleich, D., Polito, M.: Approximating personalized PageRank with minimal use of webgraph data. Internet Mathematics (to appear)
Golub, G., Greif, C.: Arnoldi-type algorithms for computing stationary distribution vectors, with application to PageRank. 10543 BIT Numerical Mathematics 46(4) (2006)
Jeh, G., Widom, J.: Scaling personalized web search. In: WWW 2003. Proceedings of the 12th World Wide Web Conference, pp. 271–279 (2003)
Lovász, L., Simonovits, M.: The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In: FOCS, pp. 346–354 (1990)
Mihail, M.: Conductance and convergence of markov chains—a combinatorial treatment of expanders. In: Proc. of 30th FOCS, pp. 526–531 (1989)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
Sarlós, T., Benczúr, A.A., Csalogány, K., Fogaras, D.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW, pp. 297–306 (2006)
Spielman, D.A., Teng, S.-H.: Spectral partitioning works: Planar graphs and finite element meshes. In: IEEE Symposium on Foundations of Computer Science, pp. 96–105 (1996)
Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersen, R., Chung, F., Lang, K. (2007). Local Partitioning for Directed Graphs Using PageRank. In: Bonato, A., Chung, F.R.K. (eds) Algorithms and Models for the Web-Graph. WAW 2007. Lecture Notes in Computer Science, vol 4863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77004-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-77004-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77003-9
Online ISBN: 978-3-540-77004-6
eBook Packages: Computer ScienceComputer Science (R0)