On the range of a regenerative sequence
For a given countable partition of the range of a regenerative sequence {Xn: n [greater-or-equal, slanted] 0}, let Rn be the number of distinct sets in the partition visited by X up to time n. We study convergence issues associated with the range sequence {Rn: n [greater-or-equal, slanted] 0}. As an application, we generalize a theorem of Chosid and Isaac to Harris recurrent Markov chains.
Year of publication: |
1985
|
---|---|
Authors: | Glynn, Peter W. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 20.1985, 1, p. 105-113
|
Publisher: |
Elsevier |
Keywords: | regenerative process range subadditive process Markov chain |
Saved in:
Saved in favorites
Similar items by person
-
Upper bounds on Poisson tail probabilities
Glynn, Peter W., (1987)
-
Regenerative structure of Markov chains simulated via common random numbers : rev. March 1985
Glynn, Peter W., (1985)
-
Simulation algorithms for regenerative processes
Glynn, Peter W., (2006)
- More ...