Computing lower and upper expected first-passage and return times in imprecise birth-death chains
From MaRDI portal
Publication:2374517
DOI10.1016/j.ijar.2016.08.008zbMath1401.60137OpenAlexW2511515580MaRDI QIDQ2374517
Stavros Lopatatzidis, Jasper De Bock, Gert De Cooman
Publication date: 15 December 2016
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.08.008
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cites Work
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Sets of probability distributions, independence, and convexity
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Independent natural extension
- On first passage time structure of random walks
- Interval-valued finite Markov chains
- Imprecise probability trees: bridging two theories of imprecise probability
- Time-homogeneous birth-death processes with probability intervals and absorbing state
- Probability and Finance
- Lower previsions
- Lower Previsions
- Actuarial Modelling of Claim Counts
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Introduction to Imprecise Probabilities
- Robust Statistics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item