Imprecise continuous-time Markov chains
From MaRDI portal
Abstract: Continuous-time Markov chains are mathematical models that are used to describe the state-evolution of dynamical systems under stochastic uncertainty, and have found widespread applications in various fields. In order to make these models computationally tractable, they rely on a number of assumptions that may not be realistic for the domain of application; in particular, the ability to provide exact numerical parameter assessments, and the applicability of time-homogeneity and the eponymous Markov property. In this work, we extend these models to imprecise continuous-time Markov chains (ICTMC's), which are a robust generalisation that relaxes these assumptions while remaining computationally tractable. More technically, an ICTMC is a set of "precise" continuous-time finite-state stochastic processes, and rather than computing expected values of functions, we seek to compute lower expectations, which are tight lower bounds on the expectations that correspond to such a set of "precise" models. Note that, in contrast to e.g. Bayesian methods, all the elements of such a set are treated on equal grounds; we do not consider a distribution over this set. The first part of this paper develops a formalism for describing continuous-time finite-state stochastic processes that does not require the aforementioned simplifying assumptions. Next, this formalism is used to characterise ICTMC's and to investigate their properties. The concept of lower expectation is then given an alternative operator-theoretic characterisation, by means of a lower transition operator, and the properties of this operator are investigated as well. Finally, we use this lower transition operator to derive tractable algorithms (with polynomial runtime complexity w.r.t. the maximum numerical error) for computing the lower expectation of functions that depend on the state at any finite number of time points.
Recommendations
- Efficient computation of the bounds of continuous time imprecise Markov chains
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Discrete time Markov chains with interval probabilities
- Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains
- Limit Behaviour of Upper and Lower Expected Time Averages in Discrete-Time Imprecise Markov Chains
Cites work
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3514748 (Why is no real title available?)
- scientific article; zbMATH DE number 3596112 (Why is no real title available?)
- scientific article; zbMATH DE number 2014741 (Why is no real title available?)
- scientific article; zbMATH DE number 1478492 (Why is no real title available?)
- scientific article; zbMATH DE number 956802 (Why is no real title available?)
- An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
- Bayesian analysis of stochastic process models
- Coherent statistical inference and Bayes theorem
- Continuous Semi‐Markov Processes
- Continuous time Markov processes. An introduction.
- Continuous-time Markov decision processes. Theory and applications
- Continuous-time controlled Markov chains.
- Credal networks
- Default times in a continuous time Markov chain economy
- Efficient computation of the bounds of continuous time imprecise Markov chains
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Finitely additive conditional probabilities
- Finitely additive conditional probabilities, conglomerability and disintegrations
- Imprecise continuous-time Markov chains
- Introduction to imprecise probabilities
- Lower Previsions
- Markov Chains
- Nonhomogeneous, continuous-time Markov chains defined by series of proportional intensity matrices
- Notes on ``Notes on conditional previsions
- Notes on conditional previsions
- On coherent conditional probabilities and disintegrations
- Optimizing the terminal wealth under partial information: the drift process as a continuous time Markov chain
- Probabilistic graphical models
- Queueing Networks and Markov Chains
- Real analysis
- Robust Filtering Through Coherent Lower Previsions
- Robust Statistics
- Robust queueing theory: an initial study using imprecise probabilities
- The limit behaviour of imprecise continuous-time Markov chains
Cited in
(22)- 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
- A generalized stochastic process: fractional \(G\)-Brownian motion
- On nonlinear expectations and Markov chains under model uncertainty
- Markov chains under nonlinear expectation
- Efficient computation of the bounds of continuous time imprecise Markov chains
- Markov Decision Processes with Imprecise Transition Probabilities
- Wasserstein perturbations of Markovian transition semigroups
- Indeterminate Markov systems
- Computing continuous-time Markov chains as transformers of unbounded observables
- Imprecise continuous-time Markov chains
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Z-relation-based multistage decision making
- Computing lower and upper expected first-passage and return times in imprecise birth-death 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
- Randomness is inherently imprecise
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
- Markov risk mappings and risk-sensitive optimal prediction
- Normal cones corresponding to credal sets of lower probabilities
- Hamilton-Jacobi-Bellman-Isaacs equation for rational inattention in the long-run management of river environments under uncertainty
- The limit behaviour of imprecise continuous-time Markov chains
This page was built for publication: Imprecise continuous-time Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411281)
