Hostname: page-component-77c89778f8-swr86 Total loading time: 0 Render date: 2024-07-22T15:40:40.961Z Has data issue: false hasContentIssue false
  • English
  • Français

Markov chains with binomial time change

Published online by Cambridge University Press:  14 July 2016

Kyle Siegrist
Kyle Siegrist*
Affiliation:
University of Alabama in Huntsville
*
∗Postal address: Department of Mathematics and Statistics, University of Alabama in Huntsville, Huntsville, AL 35899, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

The effect of a binomial time change on a given Markov chain is studied. Results are obtained for the hitting times, potential operator, and transience and recurrence properties of the time-changed chain. The limiting behavior is considered as the binomial parameter approaches 0 and the time variable approaches∞.

Type
Short Communications
Information
Journal of Applied Probability , Volume 23 , Issue 2 , June 1986 , pp. 519 - 523
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Blumenthal, R. M. and Getoor, R. K. (1968) Markov Processes and Potential Theory. Academic Press, New York.Google Scholar
Cocozza-Thivent, C., Kipnis, C. and Roussignol, M. (1983) Stabilité de la récurrence nulle pour certaines chaînes de Markov perturbés. J. Appl. Prob. 20, 482–504.CrossRefGoogle Scholar
Kurtz, T. G. (1981) Approximation of Population Processes. CBMS-NSF Conference Series, SIAM, Philadelphia.CrossRefGoogle Scholar
Norman, M. F. (1972) Markov Processes and Learning Models. Academic Press, New York.Google Scholar
Pakes, A. G. (1969) Some conditions for ergodicity and recurrence of Markov chains. Operat. Res. 17, 1058–1061.CrossRefGoogle Scholar
Pittenger, A. O. (1982) Time changes of Markov chains. Stoch. Proc. Appl. 13, 189–199.CrossRefGoogle Scholar
Siegrist, K. T. (1986) A debugging model with independent flaws and random masking. Operat. Res. 34.CrossRefGoogle Scholar