IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v111y2004i2p207-235.html
   My bibliography  Save this article

A regularity condition and a limit theorem for Harris ergodic Markov chains

Author

Listed:
  • Samur, J.D.Jorge D.

Abstract

Let (Xn)n[greater-or-equal, slanted]0 be a Harris ergodic Markov chain and f be a real function on its state space. Consider the block sums [zeta](i) for f, i[greater-or-equal, slanted]1, between consecutive visits to the atom given by the splitting technique of Nummelin. A regularity condition on the invariant probability measure [pi] and a drift property are introduced and proven to characterize the finiteness of the third moment of [zeta](i). This is applied to obtain versions of an almost sure invariance principle for the partial sums of (f(Xn)), which is moreover given in the general case, due to Philipp and Stout for the countable state space case and to Csáki and Csörgo when the chain is strongly aperiodic. Conditions on the strong mixing coefficients are considered. A drift property equivalent to the finiteness of the second moment of [zeta](i) is also given and applied to the functional central limit theorem.

Suggested Citation

  • Samur, J.D.Jorge D., 2004. "A regularity condition and a limit theorem for Harris ergodic Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 111(2), pages 207-235, June.
  • Handle: RePEc:eee:spapps:v:111:y:2004:i:2:p:207-235
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(04)00027-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chen, Xia, 1999. "Some dichotomy results for functionals of Harris recurrent Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 83(1), pages 211-236, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xia Chen, 1999. "The Law of the Iterated Logarithm for Functionals of Harris Recurrent Markov Chains: Self Normalization," Journal of Theoretical Probability, Springer, vol. 12(2), pages 421-445, April.
    2. Chen, Xia, 2000. "Chung's law for additive functionals of positive recurrent Markov chains," Statistics & Probability Letters, Elsevier, vol. 47(3), pages 253-264, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:111:y:2004:i:2:p:207-235. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.