Limit of PageRank with damping factor

Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms

Volumn 13, Issue 3-4, 2006, Pages 497-504

  Bao, Ying ^a,b   Liu, Yong ^c  

^a CHINESE ACADEMY OF SCIENCES   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

^c PEKING UNIVERSITY   (China)

Author keywords

Damping factor; Invariant probability; Markov chain; PageRank; Search engine

Indexed keywords

EID: 33750397269     PISSN: 14928760     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Y. Bao, G. Feng, Y. Liu, Z.M. Ma and X. Zheng, PageRank and Sparse Matrix, in preparation.
2. A. Berman and R.J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic Press, 1979.
3. P. Boldi, M. Santini and S. Vigna, PageRank as a function of the damping factor, in the 14th International World Wide Web Conference 2005, http://www2005.org/cdrom/docs/p557.pdf.
4. A. Border, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins and J. Wiener, Graph structure in the web, in the 9th International World Wide Web Conference, May, 2000.
5. S. Rin, L. Page, R. Motwami, T. Winograd, The PageRank citation ranking: bringing order to the web, Technical Report, Stanford Digital Library Technologies Project, Stanford University, Stanford, CA, USA, 1998.
6. J.B. Conway, A Course in Functional Analysis (Graduate Texts in Mathematics Series), Springer-Verlag, New York, U.S.A., 1997.
7. D.A. Freedman, Markov Chains, Springer-Verlag, New York, U.S.A., 1983.
8. A.N.Langville, C.D.Meyer, Deeper inside PageRank, Internet Mathematics, 1(3), 2004 355-400.
9. M.E.J. Newman, The structure and function of complex networks, arXiv: cond-mat/0303516, 1(25), Mar 2003.
10. J.R.Norris, Markov Chains, Cambridge University Press, Cambridge, 1997.
11. M.Qian, G.Gong, Theory of Stochastic Processes (the second edition) (in Chinese), Peking University Press, Beijing, 1997.