On the range of a regenerative sequence

Peter W. Glynn

Stochastic Processes and their Applications, 1985, vol. 20, issue 1, 105-113

Abstract: 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.

Keywords: regenerative; process; range; subadditive; process; Markov; chain (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(85)90019-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:20:y:1985:i:1:p:105-113

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().