Computing lower and upper hitting probabilities for imprecise Markov chains

DOI10.1016/J.IJAR.2026.109671MaRDI QIDQ7315339zbMATH OpenFDO

Authors Marco Sangalli, Rick Reubsaet, Erik Quaeghebeur, Thomas Krak

Publication date 18 August 2026

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IJAR.2026.109671

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40)

Cites work

• Characterisation of ergodic upper transition operators
• Fast linear algebra is stable
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Title not available (Why is no real title available?)
• IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
• Markov Chains
• On the theory of Markov set-chains
• Real Analysis and Probability
• Reinforcement learning. An introduction
• Robust Estimation of a Location Parameter
• Special cases
• Stochastic processes
• The limit behaviour of imprecise continuous-time Markov chains

This page was built for publication: Computing lower and upper hitting probabilities for imprecise Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7315339)