Markov Chains
Subtitle: Models, Algorithms and Applications
By: by Wai-Ki Ching, Ximin Huang, Michael K. Ng, Tak-Kuen Siu
Contributors: Huang, Ximin; Ng, Michael K.; Siu, Tak Kuen; SpringerLink (Online service)
Edition: 2nd ed. 2013.
Series: International Series in Operations Research & Management Science -- 189
Publisher: Springer US; Imprint: Springer
Published: 2013
Place of publication: Boston, MA
Language: eng
Format: [electronic resource] :
Number of pages: 243
ISBN-13: 9781461463122
Subjects: Economics/Management Science; Operation Research/Decision Theory; Management Science Operations Research; Distribution (Probability theory); Economics; Probability Theory and Stochastic Processes; Operations research
Description: This new edition of Markov Chains: Models, Algorithms and Applications has been completely reformatted as a text, complete with end-of-chapter exercises, a new focus on management science, new applications of the models, and new examples with applications in financial risk management and modeling of financial data.This book consists of eight chapters.  Chapter 1 gives a brief introduction to the classical theory on both discrete and continuous time Markov chains. The relationship between Markov chains of finite states and matrix theory will also be highlighted. Some classical iterative methods for solving linear systems will be introduced for finding the stationary distribution of a Markov chain.^

The chapter then covers the basic theories and algorithms for hidden Markov models (HMMs) and Markov decision processes (MDPs).Chapter 2 discusses the applications of continuous time Markov chains to model queueing systems and discrete time Markov chain for computing the PageRank, the ranking of websites on the Internet. Chapter 3 studies Markovian models for manufacturing and re-manufacturing systems and presents closed form solutions and fast numerical algorithms for solving the captured systems. In Chapter 4, the authors present a simple hidden Markov model (HMM) with fast numerical algorithms for estimating the model parameters. An application of the HMM for customer classification is also presented. Chapter 5 discusses Markov decision processes for customer lifetime values. Customer Lifetime Values (CLV) is an important concept and quantity in marketing management.^

The authors present an approach based on Markov decision processes for the calculation of CLV using real data.Chapter 6 considers higher-order Markov chain models, particularly a class of parsimonious higher-order Markov chain models. Efficient estimation methods for model parameters based on linear programming are presented. Contemporary research results on applications to demand predictions, inventory control and financial risk measurement are also presented. In Chapter 7, a class of parsimonious multivariate Markov models is introduced. Again, efficient estimation methods based on linear programming are presented. Applications to demand predictions, inventory control policy and modeling credit ratings data are discussed. Finally, Chapter 8 re-visits hidden Markov models, and the authors present a new class of hidden Markov models with efficient algorithms for estimating the model parameters.^

Applications to modeling interest rates, credit ratings and default data are discussed.This book is aimed at senior undergraduate students, postgraduate students, professionals, practitioners, and researchers in applied mathematics, computational science, operational research, management science and finance, who are interested in the formulation and computation of queueing networks, Markov chain models and related topics. Readers are expected to have some basic knowledge of probability theory, Markov processes and matrix theory.
Table of contents: title: Introduction; title: Manufacturing and Re-manufacturing Systems; title: A Hidden Markov Model for Customer Classification; title: Markov Decision Processes for Customer Lifetime Value; title: Higher-order Markov Chains; title: Multivariate Markov Chains; title: Hidden Markov Chains.