PageRank and random walks on graphs

Bolyai Society Mathematical Studies

Volumn 20, Issue , 2010, Pages 43-62

  Chung, Fan ^a   Zhao, Wenbo ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFECTIVE RESISTANCES; EFFICIENT APPROXIMATION ALGORITHMS; ELECTRICAL NETWORKS; HITTING TIME; MATRIX-TREE THEOREM; PAGERANK; RANDOM WALK;

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE;

RANDOM PROCESSES;

EID: 84877045921     PISSN: 12174696     EISSN: 12174696     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-642-13580-4_3     Document Type: Conference Paper

References (14)

1. 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.
2. 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.
3. 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.
4. F. Chung, Spectal Graph Theory, AMS Publication, 1997.
5. F. Chung and S.-T. Yau, Discrete Green's Functions. Journal of Combinatorial Theory, Series A, 91(1-2) (2000), pp. 191-214.
6. H. Haveliwala, Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search, IEEE Trans. Knowl. Data Eng., 15(4) (2003), pp. 784-796.
7. Glen Jeh and Jennifer Widom, Scaling personalized web search. Proceedings of the 12th World Wide Web Conference (WWW) (2003), pp. 271-279.
8. G. Green, An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism, Nottingham, 1828.
9. S. Guattery and G. L. Miller, Graph embeddings and laplacian eigenvalues, Journal on Matrix Analysis and Applications, 21(3) (2000), pp. 703-723.
10. 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.
11. 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.
12. C. St. J. A. Nash-Williams, Random walks and electronic currents in networks, Proceedings of the Cambridge Philosophical Society, 55 (1959), pp. 181-194.
13. L. Lovász, Random walks on graphs: A survey, Combinatorics, Paul Erdos is Eighty, 2 (1993), pp. 1-46.
14. 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.