Conditional steady-state bounds for a subset of states in Markov chains
SMCtools'06: Proceeding from the 2006 Workshop on Tools for Solving Structured Markov Chains
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27135
The problem of computing bounds on the conditional steady-state probability vector of a subset of states in finite, ergodic discrete-time Markov chains (DTMCs) is considered. An improved algorithm utilizing the strong stochastic (st-)order is given. On standard benchmarks from the literature and other examples, it is shown that the proposed algorithm performs better than the existing one in the strong stochastic sense. Furthermore, in certain cases the conditional steady-state probability vector of the subset under consideration can be obtained exactly. Copyright 2006 ACM.
Showing items related by title, author, creator and subject.
Simon F.; Guillen P.; Sagaut P.; Lucor, D. (2010)The present paper focus on the stochastic response of a two-dimensional transonic airfoil to parametric uncertainties. Both the freestream Mach number and the angle of attack are considered as random parameters and the ...
Goken, C.; Gezici, S.; Arikan, O. (2010)Stochastic signaling is investigated under second and fourth moment constraints for the detection of scalar-valued binary signals in additive noise channels. Sufficient conditions are derived to determine when the use of ...
Unsupervised classification of remotely sensed images using Gaussian mixture models and particle swarm optimization Ari, C.; Aksoy, S. (2010)Gaussian mixture models (GMM) are widely used for un-supervised classification applications in remote sensing. Expectation-Maximization (EM) is the standard algorithm employed to estimate the parameters of these models. ...