The limit behaviour of imprecise continuous-time Markov chains
From MaRDI portal
Abstract: We study the limit behaviour of a generally non-linear ordinary differential equation whose solution is a superadditive generalisation of a stochastic matrix, and provide necessary and sufficient conditions for this solution to be ergodic, in the sense that it converges to an operator that, essentially, maps functions to constants. In the linear case, the solution of our differential equation is equal to the matrix exponential of an intensity matrix and can then be interpreted as the transition operator of a homogeneous continuous-time Markov chain. Similarly, in the generalised non-linear case that we consider, the solution can be interpreted as the lower transition operator of a specific set of non-homogeneous continuous-time Markov chains, called an imprecise continuous-time Markov chain. In this context, our main result provides a necessary and sufficient condition for such an imprecise continuous-time Markov chain to converge to a unique limiting distribution.
Recommendations
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
- Limit Behaviour of Upper and Lower Expected Time Averages in Discrete-Time Imprecise Markov Chains
- Imprecise Markov chains with absorption
- On strong ergodicity for nonhomogeneous continuous-time Markov chains
Cites work
- scientific article; zbMATH DE number 996440 (Why is no real title available?)
- scientific article; zbMATH DE number 3150488 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- A Nonlinear Perron-Frobenius Theorem
- A Theorem on Boolean Matrices
- Characterisation of ergodic upper transition operators
- Coefficients of ergodicity for Markov chains with uncertain parameters
- Continuous-time Markov chains. An applications-oriented approach
- Continuous-time Markov decision processes. Theory and applications
- Continuous-time controlled Markov chains.
- Efficient computation of the bounds of continuous time imprecise Markov chains
- Imprecise continuous-time Markov chains
- Lower Previsions
- Non-negative matrices and Markov chains.
- Real analysis
Cited in
(9)- Limit Behaviour of Upper and Lower Expected Time Averages in Discrete-Time Imprecise Markov Chains
- Markovian imprecise jump processes: extension to measurable variables, convergence theorems and algorithms
- Application of normal cones to the computation of solutions of the nonlinear Kolmogorov backward equation
- On nonlinear expectations and Markov chains under model uncertainty
- Imprecise continuous-time Markov chains
- Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains
- Imprecise Markov chains with absorption
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
- Normal cones corresponding to credal sets of lower probabilities
This page was built for publication: The limit behaviour of imprecise continuous-time Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525496)