S. Abiteboul, M. Preda, and G. Cobena, Adaptive on-line page importance computation, Proceedings of the twelfth international conference on World Wide Web , WWW '03, pp.280-290, 2003.
DOI : 10.1145/775152.775192

D. Aldous and J. A. Fill, Reversible Markov chains and random walks on graphs, unpublished monograph, 1996.

P. Berkhin, A Survey on PageRank Computing, Internet Mathematics, vol.2, issue.1, pp.73-120, 2005.
DOI : 10.1080/15427951.2005.10129098

J. Bertoin and M. Yor, Exponential functionals of Lévy processes, Probability Surveys, pp.191-212, 2005.

P. Billingsley, Convergence of probability measures Wiley Series in Probability and Statistics: Probability and Statistics, 1999.

N. H. Bingham, Limit theorems for occupation times of Markov processes, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.14, issue.1, pp.1-22, 1971.
DOI : 10.1007/BF00538470

A. N. Borodin, The asymptotic behavior of local times of recurrent random walks with finite variance, Akademiya Nauk SSSR. Teoriya Veroyatnoste? ? i ee Primeneniya, pp.769-783, 1981.

N. Andrei, P. Borodin, and . Salminen, Handbook of Brownian motion?facts and formulae, Probability and its Applications, 1996.

S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, vol.30, issue.1-7, pp.107-117, 1998.
DOI : 10.1016/S0169-7552(98)00110-X

D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random walks on weighted graphs and applications to on-line algorithms, Journal of the ACM, vol.40, issue.3, pp.421-453, 1993.
DOI : 10.1145/174130.174131

A. Garsia and J. Lamperti, A discrete renewal theorem with infinite mean, Commentarii Mathematici Helvetici, vol.37, issue.1, pp.221-234, 1962.
DOI : 10.1007/BF02566974

I. I. Gikhman and A. V. Skorokhod, Introduction to the theory of random processes, 1996.

C. M. Goldie, Implicit Renewal Theory and Tails of Solutions of Random Equations, The Annals of Applied Probability, vol.1, issue.1, pp.126-166, 1991.
DOI : 10.1214/aoap/1177005985

F. Guillemin, P. Robert, and B. Zwart, AIMD algorithms and exponential functionals, Annals of Applied Probability, vol.14, issue.1, pp.90-117, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00072141

Y. Kasahara, A limit theorem for slowly increasing occupation times The Annals of A limit theorem for sums of random number of i.i.d. random variables and its application to occupation times of Markov chains, Journal of the Mathematical Society of Japan, vol.1016, issue.37 2, pp.728-736, 1982.

J. Keilson, Markov chains models-rarity and exponentiality, Applied Mathematical sciences, vol.28, 1979.
DOI : 10.1007/978-1-4612-6200-8

J. G. Kemeny, J. L. Snell, and A. W. Knapp, Denumerable Markov chains, Graduate Texts in Mathematics, vol.40, 1976.
DOI : 10.1007/978-1-4684-9455-6

J. F. Kingman, Inequalities in the theory of queues, Journal of the Royal Statistical Society B, vol.32, pp.102-110, 1970.

F. B. Knight, Random walks and a sojourn density process of Brownian motion, Transactions of the American Mathematical Society, vol.109, issue.1, pp.56-86, 1963.
DOI : 10.1090/S0002-9947-1963-0154337-6

N. Litvak and P. Robert, Analysis of an on-line algorithm for solving large Markov chains, The 3rd International Workshop on Tools for solving Structured Markov Chains, 2008.

J. R. Norris, Markov chains, 1998.
DOI : 10.1017/CBO9780511810633

E. Perkins, Weak invariance principles for local time, Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, pp.437-451, 1982.

P. Robert, Stochastic networks and queues, Stochastic Modelling and Applied Probability Series, 2003.

L. C. Rogers and D. Williams, Itô calculus, Diffusions, Markov processes, and martingales, 1987.

P. Tetali, Design of On-Line Algorithms Using Hitting Times, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.402-411, 1994.
DOI : 10.1137/S0097539798335511

M. Yor, Exponential functionals of Brownian motion and related processes, 2001.
DOI : 10.1007/978-3-642-56634-9