Ergodic Theory for Controlled Markov Chains with Stationary Inputs
Abstract
Consider a stochastic process \X(t)\ on a finite state space X=\1,…, d\. It is conditionally Markov, given a real-valued `input process' \ζ(t)\. This is assumed to be small, which is modeled through the scaling, \[ ζt = ζ1t, 0 1\,, \] where \ζ1(t)\ is a bounded stationary process. The following conclusions are obtained, subject to smoothness assumptions on the controlled transition matrix and a mixing condition on \ζ(t)\: (i) A stationary version of the process is constructed, that is coupled with a stationary version of the Markov chain \X(t)\obtained with \ζ(t)\ 0. The triple (\X(t)\, \X(t)\,\ζ(t)\) is a jointly stationary process satisfying \[ P\X(t) ≠ X(t)\ = O() \] Moreover, a second-order Taylor-series approximation is obtained: \[ P\X(t) =i \ = P\X(t) =i \ + 2 (i) + o(2), 1 i d, \] with an explicit formula for the vector ∈Rd. (ii) For any m 1 and any function f \1,…,d\× Rm, the stationary stochastic process Y(t) = f(X(t),ζ(t)) has a power spectral density Sf that admits a second order Taylor series expansion: A function S(2)f [-π,π] C m× m is constructed such that \[ Sf(θ) = Sf(θ) + 2 Sf(2)(θ) + o(2), θ∈ [-π,π] . \] An explicit formula for the function Sf(2) is obtained, based in part on the bounds in (i). The results are illustrated using a version of the timing channel of Anantharam and Verdu.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.