Markov chains in random environment with applications in queueing theory and machine learning
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, to machine learning algorithms and to autoregressive processes are presented.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Deep Learning for Markov Chains: Lyapunov Functions, Poisson's Equation, and Stationary Distributions
Lyapunov functions are fundamental to establishing the stability of Markovian models, yet their construction typically demands substantial creativity and analytical effort. In this paper, we show that deep learning can a…
Transition of $α$-mixing in Random Iterations with Applications in Queuing Theory
Nonlinear time series models with exogenous regressors are essential in econometrics, queuing theory, and machine learning, though their statistical analysis remains incomplete. Key results, such as the law of large numb…
EconometricsTime SeriesFinding Optimal Policy for Queueing Models: New Parameterization
Queueing systems appear in many important real-life applications including communication networks, transportation and manufacturing systems. Reinforcement learning (RL) framework is a suitable model for the queueing cont…
Navigatereinforcement-learningReinforcement Learning (RL)Optimization of Traffic Control in MMAP[c]/PH[c]/S Catastrophic Queueing Model with PH Retrial Times and Controllable Preemptive Repeat Priority Policy
The presented study elaborates a multi-server catastrophic retrial queueing model considering preemptive repeat priority policy with phase-type (PH) distributed retrial times. For the sake of comprehension, the scenario …
Many processors, little time: MCMC for partitions via optimal transport couplings
Markov chain Monte Carlo (MCMC) methods are often used in clustering since they guarantee asymptotically exact expectations in the infinite-time limit. In finite time, though, slow mixing often leads to poor performance.…
Clustering