Average Behaviour in Discrete-Time Imprecise Markov Chains: A Study of Weak Ergodicity
Natan T'Joens, Jasper De Bock

TL;DR
This paper investigates the weak ergodic behaviour of imprecise Markov chains, establishing conditions for convergence of bounds on expected time averages and demonstrating robustness across different independence assumptions.
Contribution
It introduces a weaker form of ergodicity called weak ergodicity, providing necessary and sufficient conditions for convergence and robustness results independent of independence assumptions.
Findings
Weak ergodicity ensures convergence of bounds regardless of initial state.
Convergence conditions are weaker than traditional ergodicity requirements.
Using actual expected time averages improves approximation over bounds.
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 first 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. Our condition is considerably weaker than that needed for ergodic behaviour; a similar notion which demands that marginal upper and lower expectations of functions at a single time instant converge to so-called limit-or steady state-upper and lower expectations. For this reason, we refer to our notion as `weak ergodicity'. Our second…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
