Recurrence relations for generalized hitting times for semi-Markov processes

Annals of Applied Probability

Volumn 6, Issue 2, 1996, Pages 617-649

  Silvestrov, Dmitrii S ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

Diffusion processes; Ergodic theorems; Hitting times; Queuing systems; Random walks; Recurrent relations and upper bounds for moments; Semi Markov dynamical systems; Semi Markov processes; Test functions

Indexed keywords

EID: 0030518378     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1034968147     Document Type: Article

References (34)

1. BOROVKOV, A. A. (1991). Lyapunov functions and ergodicity of multidimensional Markov chains. Theory Probab. Appl. 36 1-18.
2. CHUNG, K. L. (1954). Contributions to the theory of Markov chains. II. Trans. Amer. Math. Soc. 76 397-419.
3. CHUNG, K. L. (1960). Markov Chains with Stationary Transition Probabilities. Springer, Berlin.
4. FOSTER, F. G. (1953). On stochastic processes associated with certain queuing processes. Ann. Math. Statist. 24 355-360.
5. HASMINSKII, R. Z. (1969). Stability of Systems Differential Equations under Random Perturbations of Their Parameters. Nauka, Moscow.
6. KALASHNIKOV, V. V. (1973). Property of γ-recurrence for Markov sequences. Dokl. Akad. Nauk SSSR 213 1243-1246.
7. KALASHNIKOV, V. V. (1977). Stability analysis in queuing problems by the method of test functions. Theory Probab. Appl. 22 86-103.
8. KALASHNIKOV, V. V. (1978). Qualitative Analysis of Complex Systems Behaviour by the Test-functions Method. Nauka, Moscow.
9. KALASHNIKOV, V. V. and RACHEV, S. T. (1990). Mathematical Methods for Construction of Queuing Models. Wadsworth and Brooks/Cole, Pacific Grove, CA.
10. KEMENY, J. G. and SNELL, J. L. (1961a). Potentials for denumerable Markov chains. J. Math. Anal. Appl. 6 196-260.
11. KEMENY, J. G. and SNELL, J. L. (1961b). Finite continuous time Markov chains. Theory Probab. Appl. 6 110-115.
12. LAMPERTI, J. (1963). Criteria for stochastic processes. II. Passage-time moments. J. Math. Anal. Appl. 7 127-145.
13. MEYN, S. P. (1989). Ergodic theorems for discrete time stochastic systems using a stochastic Lyapunov function. SIAM J. Control Optim. 27 1409-1439.
14. MEYN, S. P. and TWEEDIE, R. L. (1992). Stability of Markovian processes. I. Criteria for discrete-time chains. Adv. in Appl. Probab. 24 542-574.
15. MEYN, S. P. and TWEEDIE, R. L. (1993). Markov Chains and Stochastic Stability. Springer, New York.
16. NILSSON, M. (1996). Stochastic Lyapunov functions and rate of convergence in ergodic theorems for birth-death processes. In Proceedings of the First Ukrainian-Scandinavian Conference on Stochastic Dynamical Systems: Theory and Applications, Uzhgorod, 1995. Theory of Random Processes 18 (3-4).
17. NUMMELIN, E. (1984). General Irreducible Markov Chains and Non-negative Operators. Cambridge Univ. Press.
18. NUMMELIN, E. and TUOMINEN, P. (1983). The rate of convergence in Orey's theorem for Harris recurrent Markov chains with applications to renewal theory. Stochastic Process. Appl. 15 295-311.
19. PITMAN, J. W. (1974). Uniform rates of convergence for Markov chain transition probabilities. Z. Wahrsch. Verw. Gebiete 29 193-227.
20. PITMAN, J. W. (1976). An identity for stopping times of a Markov process. In Studies in Probability and Statistics (E. J. Williams, ed.). North-Holland, Amsterdam.
21. PITMAN, J. W. (1977). Occupation measures for Markov chains. Adv. in Appl. Probab. 9 69-86.
22. SILVESTROV, D. S. (1980). Semi-Markov Processes with Discrete State Space. Soviet Radio Publishers, Moscow.
23. SILVESTROV, D. S. (1983a). Method of a single probability space in ergodic theorems for regenerative processes 1. Math. Oper. Statist. Ser. Optim. 14 286-299.
24. SILVESTROV, D. S. (1983b). Invariance principle for the processes with semi-Markov switch-overs with an arbitrary state space. Proceedings of the Fourth USSR-Japan Symposium on Probability Theory and Mathematical Statistics. Lecture Notes in Math. 1021 617-628. Springer, Berlin.
25. SILVESTROV, D. S. (1984). Method of a single probability space in ergodic theorems for regenerative processes 2, 3. Math. Oper. Statist. Ser. Optim. 16 216-231; 232-244.
26. SILVESTROV, D. S. (1993). Upper bounds for moments of hitting times for semi-Markov processes. Technical Report 14, Dept. Mathematics, Luleå Univ.
27. SILVESTROV, D. S. (1994a). Recurrent relations for generalized hitting times. Technical Report 9, Inst. Mathematical Statistics, Umeå Univ.
28. SILVESTROV, D. S. (1994b). Coupling for Markov renewal processes and the rate of convergence in ergodic theorems for processes with semi-Markov switchings. Acta Appl. Math. 34 109-124.
29. SILVESTROV, D. S. (1996). Hitting times for semi-Markov dynamical systems. In Proceedings of the First Ukrainian-Scandinavian Conference on Stochastic Dynamical Systems: Theory and Applications, Uzhgorod, 1995. Theory of Random Processes 18 (3 and 4).
30. TONG, H. (1990). Nonlinear Time Series: A Dynamical System Approach. Oxford Univ. Press.
31. TUOMINEN, P. and TWEEDIE, R. L. (1994). Subgeometric rates of convergence of f-ergodic Markov chains. Adv. in Appl. Probab. 26 775-798.
32. TWEEDIE, R. L. (1975). Sufficient conditions for ergodicity and recurrence of Markov chains on a general state space. Stochastic Process. Appl. 3 385-403.
33. TWEEDIE, R. L. (1976). Criteria for classifying general Markov chains. Adv. in Appl. Probab. 8 737-771.
34. TWEEDIE, R. L. (1983). Criteria for rates of convergence of Markov chains, with applications to queuing and storage theory. In Probability, Statistics and Analysis (J. F. G. Kingman and G. E. H. Reuter, eds.). Cambridge Univ. Press.