Abstract
We examine the relationship between PageRank and several invariants occurring in the study of random walks and electrical networks. We consider a generalized version of hitting time and effective resistance with an additional parameter which controls the ‘speed’ of diffusion. We will establish their connection with PageRank. Through these connections, a combinatorial interpretation of Page-Rank is given in terms of rooted spanning forests by using a generalized version of the matrix-tree theorem. Using PageRank, we will illustrate that the generalized hitting time leads to finding sparse cuts and efficient approximation algorithms for PageRank can be used for approximating hitting time and effective resistance.
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
R. Andersen, F. Chung and K. Lang, Local graph partitioning using pagerank vectors, Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (2006), pp. 475–486.
S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, 30(1-7) (1998), pp. 107–117.
A. k. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky and P. Tiwari, The electrical resistance of a graph captures its commute time and cover time, Proceedings of the 26th ACM Symposium on Theory of Computing (1989), pp. 574–586.
F. Chung, Spectal Graph Theory, AMS Publication, 1997.
F. Chung and S.-T. Yau, Discrete Green’s Functions. Journal of Combinatorial Theory, Series A, 91(1-2) (2000), pp. 191–214.
H. Haveliwala, Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search, IEEE Trans. Knowl. Data Eng., 15(4) (2003), pp. 784–796.
Glen Jeh and Jennifer Widom, Scaling personalized web search. Proceedings of the 12th World Wide Web Conference (WWW) (2003), pp. 271–279.
G. Green, An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism, Nottingham, 1828.
S. Guattery and G. L. Miller, Graph embeddings and laplacian eigenvalues, Journal on Matrix Analysis and Applications, 21(3) (2000), pp. 703–723.
G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. chem., 72 (1847), 497–508.
G. Kirchhoff, On the motion of electricity in conductors (Über die Bewegung der Elecktricität in Leitern), Annalen der Physik, Vol. 102 (1857), pp. 529.
C. St. J. A. Nash-Williams, Random walks and electronic currents in networks, Proceedings of the Cambridge Philosophical Society, 55 (1959), pp. 181–194.
L. Lovász, Random walks on graphs: A survey, Combinatorics, Paul Erdős is Eighty, 2 (1993), pp. 1–46.
D. A. Spielman and N. Srivastava, Graph sparsification by effective resistances, Proceedings of the 40th ACM Symposium on Theory of Computing (2008), pp. 563–568.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Chung, F., Zhao, W. (2010). PageRank and Random Walks on Graphs. In: Katona, G.O.H., Schrijver, A., Szőnyi, T., Sági, G. (eds) Fete of Combinatorics and Computer Science. Bolyai Society Mathematical Studies, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13580-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-13580-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13579-8
Online ISBN: 978-3-642-13580-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)