Discrete-Time Markov Chains

Discrete-Time Markov Chains

Two-Time-Scale Methods and Applications (Stochastic Modelling and Applied Probability)

by Qing Zhang

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
Focusing on discrete-time-scale Markov chains, the contents of this book are an outgrowth of some of the authors' recent research. The motivation stems from existing and emerging applications in optimization and control of complex hybrid Markovian systems in manufacturing, wireless communication, and financial engineering. Much effort in this book is devoted to designing system models arising from these applications, analyzing them via analytic and probabilistic techniques, and developing feasible computational algorithms so as to reduce the inherent complexity. This book presents results including asymptotic expansions of probability vectors, structural properties of occupation measures, exponential bounds, aggregation and decomposition and associated limit processes, and interface of discrete-time and continuous-time systems. One of the salient features is that it contains a diverse range of applications on filtering, estimation, control, optimization, and Markov decision processes, and financial engineering. This book will be an important reference for researchers in the areas of applied probability, control theory, operations research, as well as for practitioners who use optimization techniques. Part of the book can also be used in a graduate course of applied probability, stochastic processes, and applications.

Discuss Discrete-Time Markov Chains with other readers

Join or start a book club for Discrete-Time Markov Chains on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Discrete-Time Markov Chains?

Sign up free on Readfeed, then browse public clubs or start your own club with Discrete-Time Markov Chains as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Discrete-Time Markov Chains with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Discrete-Time Markov Chains with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.