Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Subexponential lower bounds for f-ergodic Markov processes

View through CrossRef
AbstractWe provide a criterion for establishing lower bounds on the rate of convergence in f-variation of a continuous-time ergodic Markov process to its invariant measure. The criterion consists of novel super- and submartingale conditions for certain functionals of the Markov process. It provides a general approach for proving lower bounds on the tails of the invariant measure and the rate of convergence in f-variation of a Markov process, analogous to the widely used Lyapunov drift conditions for upper bounds. Our key technical innovation produces lower bounds on the tails of the heights and durations of the excursions from bounded sets of a continuous-time Markov process using path-wise arguments. We apply our theory to elliptic diffusions and Lévy-driven stochastic differential equations with known polynomial/stretched exponential upper bounds on their rates of convergence. Our lower bounds match asymptotically the known upper bounds for these classes of models, thus establishing their rate of convergence to stationarity. The generality of the approach suggests that, analogous to the Lyapunov drift conditions for upper bounds, our methods can be expected to find applications in many other settings.
Title: Subexponential lower bounds for f-ergodic Markov processes
Description:
AbstractWe provide a criterion for establishing lower bounds on the rate of convergence in f-variation of a continuous-time ergodic Markov process to its invariant measure.
The criterion consists of novel super- and submartingale conditions for certain functionals of the Markov process.
It provides a general approach for proving lower bounds on the tails of the invariant measure and the rate of convergence in f-variation of a Markov process, analogous to the widely used Lyapunov drift conditions for upper bounds.
Our key technical innovation produces lower bounds on the tails of the heights and durations of the excursions from bounded sets of a continuous-time Markov process using path-wise arguments.
We apply our theory to elliptic diffusions and Lévy-driven stochastic differential equations with known polynomial/stretched exponential upper bounds on their rates of convergence.
Our lower bounds match asymptotically the known upper bounds for these classes of models, thus establishing their rate of convergence to stationarity.
The generality of the approach suggests that, analogous to the Lyapunov drift conditions for upper bounds, our methods can be expected to find applications in many other settings.

Related Results

On the Subexponential-Time Complexity of CSP
On the Subexponential-Time Complexity of CSP
Not all NP-complete problems share the same practical hardness with respect to exact computation. Whereas some NP-complete problems are amenable to efficient computational methods...
ANALISA PERBANDINGAN METODE CELLULAR AUTOMATA ANN DAN MARKOV UNTUK PREDIKSI TUTUPAN LAHAN DI KOTA BLITAR
ANALISA PERBANDINGAN METODE CELLULAR AUTOMATA ANN DAN MARKOV UNTUK PREDIKSI TUTUPAN LAHAN DI KOTA BLITAR
ABSTRACT The development of urban areas in Blitar City, which is triggered by population growth and mobility, has caused changes in land cover, especially the reduction in rice fie...
Vladimir Abramovich Rokhlin (23 August 1919 to 3 December 1984): Introductory note
Vladimir Abramovich Rokhlin (23 August 1919 to 3 December 1984): Introductory note
The Ergodic Theory and Dynamical Systems journal pays tribute to V. A. Rokhlin, one of the founders of ergodic theory, a world-renowned topologist and geometer, and a man of tragic...
Subexponential Concentration Inequalities for Bifurcating Markov Chains
Subexponential Concentration Inequalities for Bifurcating Markov Chains
In this paper, for bifurcating Markov chains, under weak and general conditions, we establish explicit subexponential concentration inequalities for different types of empirical me...
An Algorithmic Classification of Generalized Pseudo-Anosov Homeomorphisms via Geometric Markov Partitions
An Algorithmic Classification of Generalized Pseudo-Anosov Homeomorphisms via Geometric Markov Partitions
Une Classification Algorithmique des Homéomorphismes Pseudo-Anosov Généralisés via les Partitions Géométriques de Markov Cette thèse vise à fournir une classificati...
An Entropy Rate Theorem for a Hidden Inhomogeneous Markov Chain
An Entropy Rate Theorem for a Hidden Inhomogeneous Markov Chain
Objective: The main object of our study is to extend some entropy rate theorems to a Hidden Inhomogeneous Markov Chain (HIMC) and establish an entropy rate theo...
Ergodic Subspace Analysis
Ergodic Subspace Analysis
Properties of psychological variables at the mean or variance level can differ between persons and within persons across multiple time points. For example, cross-sectional findings...

Back to Top