Limit behaviour of upper and lower expected time averages in discrete-time imprecise markov chains

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the limit behaviour of upper and lower bounds on expected time averages in imprecise Markov chains; a generalised type of Markov chain where the local dynamics, traditionally characterised by transition probabilities, are now represented by sets of ‘plausible’ transition probabilities. Our main result is a necessary and sufficient condition under which these upper and lower bounds, called upper and lower expected time averages, will converge as time progresses towards infinity to limit values that do not depend on the process’ initial state. Remarkably, our condition is considerably weaker than those needed to establish similar results for so-called limit—or steady state—upper and lower expectations, which are often used to provide approximate information about the limit behaviour of time averages as well. We show that such an approximation is sub-optimal and that it can be significantly improved by directly using upper and lower expected time averages.

Cite

CITATION STYLE

APA

T’Joens, N., & De Bock, J. (2020). Limit behaviour of upper and lower expected time averages in discrete-time imprecise markov chains. In Communications in Computer and Information Science (Vol. 1238 CCIS, pp. 224–238). Springer. https://doi.org/10.1007/978-3-030-50143-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free