Transforming stochastic matrices for stochastic comparison with the st-order
From MaRDI portal
Publication:4450559
DOI10.1051/ro:2003015zbMath1036.60063OpenAlexW4300528916MaRDI QIDQ4450559
Jean-Michel Fourneau, Tuǧrul Dayar, Nihal Pekergin
Publication date: 15 February 2004
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_2_85_0
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random matrices (algebraic aspects) (15B52)
Related Items (3)
An algebraic model for the propagation of errors in matrix calculus ⋮ Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach ⋮ Iterative component‐wise bounds for the steady‐state distribution of a Markov chain
Cites Work
- Monotone matrices and monotone Markov processes
- Algorithms for an irreducible and lumpable strong stochastic bound
- Stochastic Orderings for Markov Processes on Partially Ordered Spaces
- Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
- Stochastic performance bounds by state space reduction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Transforming stochastic matrices for stochastic comparison with the st-order