z-logo
open-access-imgOpen Access
Detecting Markov Chain Instability: A Monte Carlo Approach
Author(s) -
Michel Mandjes,
Brendan Patch,
Neil Walton
Publication year - 2017
Publication title -
stochastic systems
Language(s) - English
Resource type - Journals
ISSN - 1946-5238
DOI - 10.1287/stsy.2017.0003
Subject(s) - markov chain , markov chain monte carlo , computer science , set (abstract data type) , mathematical optimization , monte carlo method , queueing theory , mathematics , markov chain mixing time , stability (learning theory) , simulated annealing , parameter space , algorithm , variable order markov model , markov model , statistics , machine learning , programming language
We devise a Monte Carlo based method for detecting whether a non-negative Markov chain is stable for a given set of parameter values. More precisely, for a given subset of the parameter space, we develop an algorithm that is capable of deciding whether the set has a subset of positive Lebesgue measure for which the Markov chain is unstable. The approach is based on a variant of simulated annealing, and consequently only mild assumptions are needed to obtain performance guarantees. The theoretical underpinnings of our algorithm are based on a result stating that the stability of a set of parameters can be phrased in terms of the stability of a single Markov chain that searches the set for unstable parameters. Our framework leads to a procedure that is capable of performing statistically rigorous tests for instability, which has been extensively tested using several examples of standard and non-standard queueing networks.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom