Long-range dependence of Markov chains in discrete time on countable state space

K. J.E. Carpio*, D. J. Daley

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    5 Citations (Scopus)

    Abstract

    When {Xn} is an irreducible, stationary, aperiodic Markov chain on the countable state space χ = {i, j, ...}, the study of long-range dependence of any square integrable functional {Yn} := {yX n} of the chain, for any real-valued function {yi : i ε χ}, involves in an essential manner the functions Oij n = ∑r=1n (pijr - πj), where pijr = P{Xr = j | X0 = i) is the r-step transition probability for the chain and {πi ε χ} = P{Xn = i} is the stationary distribution for {Xn}. The simplest functional arises when Y n is the indicator sequence for visits to some particular state i, Ini = I{Xn=i} say, in which case lim sup n→∞ n-1 var(Y1 + ⋯ + Y n) = lim supn→∞ n-1 (Ni (0, n]) = ∞ if and only if the generic return time random variable T ii for the chain to return to state i starting from i has infinite second moment (here, Ni (0, n] denotes the number of visits of X r to state i in the time epochs {1, ... , n}). This condition is equivalent to Qjin → ∞ for one (and then every) state j, or to E(Tjj2) = ∞ for one (and then every) state j, and when it holds, (Qijnj)/ {Qkknk) → 1 for n → ∞ for any triplet of states i, j, k.

    Original languageEnglish
    Pages (from-to)1047-1055
    Number of pages9
    JournalJournal of Applied Probability
    Volume44
    Issue number4
    DOIs
    Publication statusPublished - Dec 2007

    Fingerprint

    Dive into the research topics of 'Long-range dependence of Markov chains in discrete time on countable state space'. Together they form a unique fingerprint.

    Cite this