Constructive Markov chains indexed by \(\mathbb Z\) (Q2371952)

From MaRDI portal
Revision as of 17:45, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Constructive Markov chains indexed by \(\mathbb Z\)
scientific article

    Statements

    Constructive Markov chains indexed by \(\mathbb Z\) (English)
    0 references
    0 references
    0 references
    9 July 2007
    0 references
    The authors are concerned with general state space Markov processes \((X_{n})_{n\in \mathbb{Z}}\), governed by recurrence relations of the form \(X_{n+1}=f_{n}( X_{n},V_{n+1}) \), where \( (V_{n})_{n\in \mathbb{Z}}\) is a doubly infinite sequence of i.i.d. random variables such that \(V_{n+1}\) is independent of the sequence \(((X_{k},V_{k}))_{k\leq n}\). Three cases are considered: the general one just described, the homogeneous case \(f_{n}=f\), \(n\in \mathbb{Z}\), for a countable state space, and the homogeneous case for a finite state space. In the second case, the authors give a necessary and sufficient condition under which the sequence \((V_{n})_{n\in \mathbb{Z}}\) fully determines the process \((X_{n})_{n\in \mathbb{Z}}\). Moreover, in the third case, they describe the missing information when this does not happen. A result of \textit{M. Rosenblatt} [J. Math. Mech. 8, 665--681 (1959; Zbl 0092.33601)] is generalized and improved.
    0 references
    Recursive Markov chain
    0 references
    filtration
    0 references

    Identifiers