Pages that link to "Item:Q902823"
From MaRDI portal
The following pages link to Efficient computation of the bounds of continuous time imprecise Markov chains (Q902823):
Displaying 14 items.
- Random walks on graphs with interval weights and precise marginals (Q274449) (← links)
- The limit behaviour of imprecise continuous-time Markov chains (Q525496) (← links)
- Discrete time Markov chains with interval probabilities (Q962945) (← links)
- Errors bounds for finite approximations of coherent lower previsions on finite probability spaces (Q1726342) (← links)
- Normal cones corresponding to credal sets of lower probabilities (Q2092444) (← links)
- Markovian imprecise jump processes: extension to measurable variables, convergence theorems and algorithms (Q2152515) (← links)
- On nonlinear expectations and Markov chains under model uncertainty (Q2237129) (← links)
- Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains (Q2302810) (← links)
- Computing lower and upper expected first-passage and return times in imprecise birth-death chains (Q2374517) (← links)
- Imprecise continuous-time Markov chains (Q2411281) (← links)
- Extended Laplace principle for empirical measures of a Markov chain (Q5203894) (← links)
- Hyperaccurate bounds in discrete-state Markovian systems (Q5878948) (← links)
- Markov chains under nonlinear expectation (Q6054140) (← links)
- Application of normal cones to the computation of solutions of the nonlinear Kolmogorov backward equation (Q6570269) (← links)