Table of Contents
Fetching ...

Inverse Problems for Ergodicity of Markov Chains

Zhi-Feng Wei

Abstract

For both continuous-time and discrete-time Markov Chains, we provide criteria for inverse problems of classical types of ergodicity: (ordinary) erogodicity, algebraic ergodicity, exponential ergodicity and strong ergodicity. Our criteria are in terms of the existence of solutions to inequalities involving the $Q$-matrix (or transition matrix $P$ in time-discrete case) of the process. Meanwhile, these criteria are applied to some examples and provide "universal" treatment, including single birth processes and several multi-dimensional models.

Inverse Problems for Ergodicity of Markov Chains

Abstract

For both continuous-time and discrete-time Markov Chains, we provide criteria for inverse problems of classical types of ergodicity: (ordinary) erogodicity, algebraic ergodicity, exponential ergodicity and strong ergodicity. Our criteria are in terms of the existence of solutions to inequalities involving the -matrix (or transition matrix in time-discrete case) of the process. Meanwhile, these criteria are applied to some examples and provide "universal" treatment, including single birth processes and several multi-dimensional models.

Paper Structure

This paper contains 10 sections, 30 theorems, 142 equations.

Key Result

Theorem 1

Let $Q$ be an irreducible regular $Q$-matrix and $H$ a non-empty finite subset of a countable state space $E$. Then the $Q$-process is strongly ergodic if and only if there exists a bounded solution $(y_i)_{i\in E}$ to inequality

Theorems & Definitions (63)

  • Theorem : hou1988twd1981
  • Theorem \oldthetheorem
  • Theorem \oldthetheorem
  • Remark
  • Theorem \oldthetheorem
  • Theorem \oldthetheorem
  • Example
  • Example
  • Theorem \ref{in_erg_con}$^\prime$
  • Theorem \ref{in_serg_con}$^\prime$
  • ...and 53 more