Google PageRank as mean playing time for pinball on the reverse web

Applied Mathematics Letters

Volumn 18, Issue 12, 2005, Pages 1359-1362

  Higham, Desmond J ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GAME THEORY; LINEAR SYSTEMS; RANDOM PROCESSES; TELECOMMUNICATION LINKS; WORLD WIDE WEB;

GOOGLE PAGERANK; LINEAR RECURRENCE ALGORITHMS; PINBALL; RANDOM WALK;

SEARCH ENGINES;

EID: 26844466209     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2005.02.020     Document Type: Article

References (6)

1. L. Page, S. Brin, R. Motwani, T. Winograd, The PageRank citation ranking: Bringing order to the web, Technical Report, Stanford Digital Library Technologies Project, 1998
2. D.J. Higham, and A. Taylor The sleekest link algorithm The Institute of Mathematics and Its Applications (IMA) Mathematics Today 39 2003 192 197
3. A.N. Langville, and C.D. Meyer Deeper inside PageRank Internet Mathematics 1 2005 335 380
4. J.R. Norris Markov Chains 1997 Cambridge University Press
5. G. Grimmett, and D. Stirzaker Probability and Random Processes 3rd edition 2001 Oxford University Press
6. G.H. Golub, and C.F. Van Loan Matrix Computations 3rd edition 1996 Johns Hopkins University Press Baltimore