Markov chains in random environment with applications in queueing theory and machine learning

11/11/2019
by   Attila Lovas, et al.
0

We prove the existence of limiting distributions for a large class of Markov chains on a general state space in a random environment. We assume suitable versions of the standard drift and minorization conditions. In particular, the system dynamics should be contractive on the average with respect to the Lyapunov function and large enough small sets should exist with large enough minorization constants. We also establish that a law of large numbers holds for bounded functionals of the process. Applications to queuing systems and to machine learning algorithms are presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/13/2021

Ergodic properties of some Markov chains models in random environments

We study ergodic properties of some Markov chains models in random envir...
research
03/29/2022

On Convergence of General Truncation-Augmentation Schemes for Approximating Stationary Distributions of Markov Chains

In the analysis of Markov chains and processes, it is sometimes convenie...
research
04/28/2022

Singular value distribution of dense random matrices with block Markovian dependence

A block Markov chain is a Markov chain whose state space can be partitio...
research
07/05/2022

A Tutorial on the Spectral Theory of Markov Chains

Markov chains are a class of probabilistic models that have achieved wid...
research
01/14/2020

FunMC: A functional API for building Markov Chains

Constant-memory algorithms, also loosely called Markov chains, power the...
research
01/03/2018

Optimal Learning from the Doob-Dynkin lemma

The Doob-Dynkin Lemma gives conditions on two functions X and Y that ens...
research
08/28/2019

A Liouville principle for the random conductance model under degenerate conditions

We consider a random conductance model on the d-dimensional lattice, d∈[...

Please sign up or login with your details

Forgot password? Click here to reset