Reduced System Algorithms for Markov Chains

DOI10.1287/MNSC.34.10.1202MaRDI QIDQ3834833zbMATH OpenOpenAlexFDO

Authors Ram Lal, U. Narayan Bhat

Publication date 1988

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.34.10.1202

zbMATH Keywords

first passage time distributionqueueing theorysteady state probabilities

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Queueing theory (aspects of probability theory) (60K25) Operations research and management science (90B99)

Recommendations

• Reduced systems in Markov chains and their applications in queueing theory
• Algorithms for finding steady state probabilities for some special classes of finite state Markov chains
• Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
• On a new method of Markov chain reduction
• scientific article; zbMATH DE number 729460

Cited in

(8)

• Reduced systems in Markov chains and their applications in queueing theory
• Optimizing steady state Markov chains by state reduction
• The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
• Steady-State Approximation for a Vector Valued Markov Chain
• Computing absorption probabilities for a Markov chain
• Computing mean first passage times for a Markov chain
• Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
• On a new method of Markov chain reduction

This page was built for publication: Reduced System Algorithms for Markov Chains

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