Numerical Methods for Structured Markov Chains

Numerical Methods for Structured Markov Chains

Author: Dario A. Bini

Publisher: OUP Oxford

Published: 2005-02-03

Total Pages: 340

ISBN-13: 9780198527688

DOWNLOAD EBOOK

Intersecting two large research areas - numerical analysis and applied probability/queuing theory - this book is a self-contained introduction to the numerical solution of structured Markov chains, which have a wide applicability in queuing theory and stochastic modeling and include M/G/1 and GI/M/1-type Markov chain, quasi-birth-death processes, non-skip free queues and tree-like stochastic processes. Written for applied probabilists and numerical analysts, but accessible toengineers and scientists working on telecommunications and evaluation of computer systems performances, it provides a systematic treatment of the theory and algorithms for important families of structured Markov chains and a thorough overview of the current literature.The book, consisting of nine Chapters, is presented in three parts. Part 1 covers a basic description of the fundamental concepts related to Markov chains, a systematic treatment of the structure matrix tools, including finite Toeplitz matrices, displacement operators, FFT, and the infinite block Toeplitz matrices, their relationship with matrix power series and the fundamental problems of solving matrix equations and computing canonical factorizations. Part 2 deals with the description andanalysis of structure Markov chains and includes M/G/1, quasi-birth-death processes, non-skip-free queues and tree-like processes. Part 3 covers solution algorithms where new convergence and applicability results are proved. Each chapter ends with bibliographic notes for further reading, and the bookends with an appendix collecting the main general concepts and results used in the book, a list of the main annotations and algorithms used in the book, and an extensive index.


Computations with Markov Chains

Computations with Markov Chains

Author: William J. Stewart

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 605

ISBN-13: 1461522412

DOWNLOAD EBOOK

Computations with Markov Chains presents the edited and reviewed proceedings of the Second International Workshop on the Numerical Solution of Markov Chains, held January 16--18, 1995, in Raleigh, North Carolina. New developments of particular interest include recent work on stability and conditioning, Krylov subspace-based methods for transient solutions, quadratic convergent procedures for matrix geometric problems, further analysis of the GTH algorithm, the arrival of stochastic automata networks at the forefront of modelling stratagems, and more. An authoritative overview of the field for applied probabilists, numerical analysts and systems modelers, including computer scientists and engineers.


Probability and Random Processes for Electrical and Computer Engineers

Probability and Random Processes for Electrical and Computer Engineers

Author: John A. Gubner

Publisher: Cambridge University Press

Published: 2006-06-01

Total Pages: 4

ISBN-13: 1139457179

DOWNLOAD EBOOK

The theory of probability is a powerful tool that helps electrical and computer engineers to explain, model, analyze, and design the technology they develop. The text begins at the advanced undergraduate level, assuming only a modest knowledge of probability, and progresses through more complex topics mastered at graduate level. The first five chapters cover the basics of probability and both discrete and continuous random variables. The later chapters have a more specialized coverage, including random vectors, Gaussian random vectors, random processes, Markov Chains, and convergence. Describing tools and results that are used extensively in the field, this is more than a textbook; it is also a reference for researchers working in communications, signal processing, and computer network traffic analysis. With over 300 worked examples, some 800 homework problems, and sections for exam preparation, this is an essential companion for advanced undergraduate and graduate students. Further resources for this title, including solutions (for Instructors only), are available online at www.cambridge.org/9780521864701.


Markov Chains: Models, Algorithms and Applications

Markov Chains: Models, Algorithms and Applications

Author: Wai-Ki Ching

Publisher: Springer Science & Business Media

Published: 2006-06-05

Total Pages: 212

ISBN-13: 038729337X

DOWNLOAD EBOOK

Markov chains are a particularly powerful and widely used tool for analyzing a variety of stochastic (probabilistic) systems over time. This monograph will present a series of Markov models, starting from the basic models and then building up to higher-order models. Included in the higher-order discussions are multivariate models, higher-order multivariate models, and higher-order hidden models. In each case, the focus is on the important kinds of applications that can be made with the class of models being considered in the current chapter. Special attention is given to numerical algorithms that can efficiently solve the models. Therefore, Markov Chains: Models, Algorithms and Applications outlines recent developments of Markov chain models for modeling queueing sequences, Internet, re-manufacturing systems, reverse logistics, inventory systems, bio-informatics, DNA sequences, genetic networks, data mining, and many other practical systems.


Introduction to Probability

Introduction to Probability

Author: David F. Anderson

Publisher: Cambridge University Press

Published: 2017-11-02

Total Pages: 447

ISBN-13: 110824498X

DOWNLOAD EBOOK

This classroom-tested textbook is an introduction to probability theory, with the right balance between mathematical precision, probabilistic intuition, and concrete applications. Introduction to Probability covers the material precisely, while avoiding excessive technical details. After introducing the basic vocabulary of randomness, including events, probabilities, and random variables, the text offers the reader a first glimpse of the major theorems of the subject: the law of large numbers and the central limit theorem. The important probability distributions are introduced organically as they arise from applications. The discrete and continuous sides of probability are treated together to emphasize their similarities. Intended for students with a calculus background, the text teaches not only the nuts and bolts of probability theory and how to solve specific problems, but also why the methods of solution work.


Random Walks and Electric Networks

Random Walks and Electric Networks

Author: Peter G. Doyle

Publisher: American Mathematical Soc.

Published: 1984-12-31

Total Pages: 174

ISBN-13: 1614440220

DOWNLOAD EBOOK

Probability theory, like much of mathematics, is indebted to physics as a source of problems and intuition for solving these problems. Unfortunately, the level of abstraction of current mathematics often makes it difficult for anyone but an expert to appreciate this fact. Random Walks and electric networks looks at the interplay of physics and mathematics in terms of an example—the relation between elementary electric network theory and random walks —where the mathematics involved is at the college level.


Computational Probability

Computational Probability

Author: Winfried K. Grassmann

Publisher: Springer Science & Business Media

Published: 2000

Total Pages: 514

ISBN-13: 9780792386179

DOWNLOAD EBOOK

Great advances have been made in recent years in the field of computational probability. In particular, the state of the art - as it relates to queuing systems, stochastic Petri-nets and systems dealing with reliability - has benefited significantly from these advances. The objective of this book is to make these topics accessible to researchers, graduate students, and practitioners. Great care was taken to make the exposition as clear as possible. Every line in the book has been evaluated, and changes have been made whenever it was felt that the initial exposition was not clear enough for the intended readership. The work of major research scholars in this field comprises the individual chapters of Computational Probability. The first chapter describes, in nonmathematical terms, the challenges in computational probability. Chapter 2 describes the methodologies available for obtaining the transition matrices for Markov chains, with particular emphasis on stochastic Petri-nets. Chapter 3 discusses how to find transient probabilities and transient rewards for these Markov chains. The next two chapters indicate how to find steady-state probabilities for Markov chains with a finite number of states. Both direct and iterative methods are described in Chapter 4. Details of these methods are given in Chapter 5. Chapters 6 and 7 deal with infinite-state Markov chains, which occur frequently in queueing, because there are times one does not want to set a bound for all queues. Chapter 8 deals with transforms, in particular Laplace transforms. The work of Ward Whitt and his collaborators, who have recently developed a number of numerical methods for Laplace transform inversions, is emphasized in this chapter. Finally, if one wants to optimize a system, one way to do the optimization is through Markov decision making, described in Chapter 9. Markov modeling has found applications in many areas, three of which are described in detail: Chapter 10 analyzes discrete-time queues, Chapter 11 describes networks of queues, and Chapter 12 deals with reliability theory.


An Introduction to Markov Processes

An Introduction to Markov Processes

Author: Daniel W. Stroock

Publisher: Springer Science & Business Media

Published: 2013-10-28

Total Pages: 213

ISBN-13: 3642405231

DOWNLOAD EBOOK

This book provides a rigorous but elementary introduction to the theory of Markov Processes on a countable state space. It should be accessible to students with a solid undergraduate background in mathematics, including students from engineering, economics, physics, and biology. Topics covered are: Doeblin's theory, general ergodic properties, and continuous time processes. Applications are dispersed throughout the book. In addition, a whole chapter is devoted to reversible processes and the use of their associated Dirichlet forms to estimate the rate of convergence to equilibrium. These results are then applied to the analysis of the Metropolis (a.k.a simulated annealing) algorithm. The corrected and enlarged 2nd edition contains a new chapter in which the author develops computational methods for Markov chains on a finite state space. Most intriguing is the section with a new technique for computing stationary measures, which is applied to derivations of Wilson's algorithm and Kirchoff's formula for spanning trees in a connected graph.


Markov Chains and Stochastic Stability

Markov Chains and Stochastic Stability

Author: Sean Meyn

Publisher: Cambridge University Press

Published: 2009-04-02

Total Pages: 623

ISBN-13: 0521731828

DOWNLOAD EBOOK

New up-to-date edition of this influential classic on Markov chains in general state spaces. Proofs are rigorous and concise, the range of applications is broad and knowledgeable, and key ideas are accessible to practitioners with limited mathematical background. New commentary by Sean Meyn, including updated references, reflects developments since 1996.


Continuous-Time Markov Chains and Applications

Continuous-Time Markov Chains and Applications

Author: G. George Yin

Publisher: Springer Science & Business Media

Published: 2012-11-14

Total Pages: 442

ISBN-13: 1461443466

DOWNLOAD EBOOK

This book gives a systematic treatment of singularly perturbed systems that naturally arise in control and optimization, queueing networks, manufacturing systems, and financial engineering. It presents results on asymptotic expansions of solutions of Komogorov forward and backward equations, properties of functional occupation measures, exponential upper bounds, and functional limit results for Markov chains with weak and strong interactions. To bridge the gap between theory and applications, a large portion of the book is devoted to applications in controlled dynamic systems, production planning, and numerical methods for controlled Markovian systems with large-scale and complex structures in the real-world problems. This second edition has been updated throughout and includes two new chapters on asymptotic expansions of solutions for backward equations and hybrid LQG problems. The chapters on analytic and probabilistic properties of two-time-scale Markov chains have been almost completely rewritten and the notation has been streamlined and simplified. This book is written for applied mathematicians, engineers, operations researchers, and applied scientists. Selected material from the book can also be used for a one semester advanced graduate-level course in applied probability and stochastic processes.