Ergodicity Of Markov Processes Via Nonstandard Analysis

View the abstract.

We use nonstandard analysis to significantly generalize the well-known Markov chain ergodic theorem and establish a fundamentally new complete class theorem, making progress on two core problems in stochastic process theory and statistical decision theory, respectively. In the first part, we study the ergodicity of time-homogenous Markov processes. A time-homogeneous Markov process with stationary distribution $\pi$ is said to be ergodic if its transition probability converges to $\pi$ in total variation distance. In the most general setting of continuous-time Markov processes with general state spaces, there are few results characterizing the ergodicity of the underlying Markov processes. Using the method of nonstandard analysis, for every standard Markov process $\{X_t\}_{t\geq 0}$, we construct a nonstandard Markov process $\{X'_t\}_{t\in T}$ that inherits most of the key properties of $\{X_t\}_{t\geq 0}$ hence establishing the ergodicity without technical conditions, such as on drift or skeleton chains. In the second part, we study the relationship between frequentist and Bayesian optimality, extending the line of work initiated by Wald in the 1940's. Existing results are subject to technical conditions that rule out semi-parametric decision problems and generally rule out non-parametric ones. Using nonstandard analysis, we show that, among decision procedures with finite risk functions, a decision procedure is extended admissible if and only if its extension has infinitesimal excess Bayes risk. The result holds in complete generality, i.e, without regularity conditions or restrictions on the model or the loss function. This nonstandard characterization of extended admissibility also generates a purely standard theorem: when risk functions are continuous on a compact Hausdorff parameter space, a procedure is extended admissible if and only if it is Bayes.

The general topic of this book is the ergodic behavior of Markov processes. A detailed introduction to methods for proving ergodicity and upper bounds for ergodic rates is presented in the first part of the book, with the focus put on weak ergodic rates, typical for Markov systems with complicated structure. The second part is devoted to the application of these methods to limit theorems for functionals of Markov processes. The book is aimed at a wide audience with a background in probability and measure theory. Some knowledge of stochastic processes and stochastic differential equations helps in a deeper understanding of specific examples. Contents Part I: Ergodic Rates for Markov Chains and Processes Markov Chains with Discrete State Spaces General Markov Chains: Ergodicity in Total Variation MarkovProcesseswithContinuousTime Weak Ergodic Rates Part II: Limit Theorems The Law of Large Numbers and the Central Limit Theorem Functional Limit Theorems

View the abstract.

View the abstract.

View the abstract.

View the abstract.

View the abstract.

View the abstract.

View the abstract.