Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
From MaRDI portal
Publication:2237163
DOI10.1016/j.ijar.2021.03.001OpenAlexW3135691773MaRDI QIDQ2237163
Publication date: 27 October 2021
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.04793
weak ergodicityimprecise Markov chainepistemic irrelevancecomplete independenceexpected time averagerepetition independence
Related Items (4)
Markovian imprecise jump processes: extension to measurable variables, convergence theorems and algorithms ⋮ Ergodic theorems for capacity preserving \(\mathbb{Z}_+^d\)-actions ⋮ Randomness is inherently imprecise ⋮ Ergodic theorems for dynamic imprecise probability kinematics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Sets of probability distributions, independence, and convexity
- Characterisation of ergodic upper transition operators
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Discrete time Markov chains with interval probabilities
- Markov set-chains
- Credal networks
- From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.
- A recursive algorithm for computing inferences in imprecise Markov chains
- Credal networks under epistemic irrelevance
- Imprecise continuous-time Markov chains
- Probabilistic graphical models
- Lower Previsions
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- The Perron-Frobenius theorem for homogeneous, monotone functions
- Introduction to Imprecise Probabilities
- Stochastic processes
- Limit Behaviour of Upper and Lower Expected Time Averages in Discrete-Time Imprecise Markov Chains
This page was built for publication: Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
