Random walks with "back buttons"

Annals of Applied Probability

Volumn 11, Issue 3, 2001, Pages 810-862

  Fagin, Ronald ^a   Karlin, Anna R ^c   Kleinberg, Jon ^b   Raghavan, Prabhakar ^d   Rajagopalan, Sridhar ^a   Rubinfeld, Ronitt ^e   Sudan, Madhu ^e   Tomkins, Andrew ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c University of Washington   (United States)

^d Verity Inc   (United States)

^e NONE

Author keywords

Denumerable markov chains; Limiting distributions; Stochastic processes; Worldwide web

Indexed keywords

EID: 0035731625     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1015345350     Document Type: Article

References (13)

1. Barrett, R., Maglio, P.P. and Kellem, D.C. (1997). How to personalize to web. In Proceedings of the ACM Conference on Human Factors in Computing Systems 75-82. ACM, New York.
2. Birkhoff, G. (1957). Extensions of Jentzsch's theorem, Trans. Amer. Math. Soc. 85 219-227.
3. Charikar, M., Kumar, S. R., Raghavan, P., Rajagopalan, S. and Tomkins, A. (1999). On targeting Markov segments, In Proceedings of the ACM Symposium on Theory of Computing 99-108. ACM, New York.
4. Grotschel, M., Lovasz, L. and Schrijver, A. (1987). Geometric Algorithms and Combinatorial Optimizations. Springer, Berlin.
5. Gurvits, L. (2000). Personal communication.
6. Hardy, G. H., Littlewood, J. E. and Pólya, G. (1964). Inequalities. Cambridge Univ. Press.
7. Horn, R. A. and Johnson, C. A. (1985), Matrix Analysis. Cambridge Univ. Press.
8. Karlin, S. and Taylor, H. (1975). A First Course in Stochastic Processes. Academic Press, New York.
9. Kemeny, J. G., Snell, J. L. and Knapp, A. W. (1966). Denumerable Markov Chains. Van Nostrand, Princeton, NJ.
10. Lieberman, H. (1995). An agent that assists web browsing. In Proceedings of International Joint Conference on Artificial Intelligence 924-929. Morgan Kaufmann, San Francisco.
11. Minc, H. (1988). Nonnegative Matrices. Wiley, New York.
12. Motwani, R. and Raghavan, P. (1994). Randomized Algorithms. Cambridge Univ. Press.
13. Selker, T. (1994). COACH: a teaching agent that learns. Communications of the ACM 37 92-99.