Markov Chains and Stochastic Stability

This book describes the modern theory of general state space Markov chains, and the application of that theory to operations research, time series analysis, and systems and control theory.

**Tag(s):**
Operations Research

**Publication date**:

**ISBN-10**:
0387198326

**ISBN-13**:
n/a

**Paperback**:
548 pages

**Views**: 16,401

Markov Chains and Stochastic Stability

This book describes the modern theory of general state space Markov chains, and the application of that theory to operations research, time series analysis, and systems and control theory.

Book Excerpts:

This book describes the modern theory of general state space Markov chains, and the application of that theory to operations research, time series analysis, and systems and control theory. It is intended as an advanced graduate text in any of these areas, as well as being a research monograph incorporating a new and thorough treatment of the stability of general Markov chains.

There are several key themes in this book which interweave to a surprising extent in both the mathematics and its implementation. There is the use of the splitting technique, which provides an approach to general state space chains through regeneration methods; the systematic use of "Foster-Lyapunov" drift criteria, both in improving the theory and in enabling the classification of individual chains; the delineation of appropriate continuity conditions to link the general theory with the properties of chains on, in particular, Euclidean space; and the development of control model approaches, enabling analysis of models from their deterministic counterparts.

The applications cover storage systems, including some networks models as well as more traditional GI/G/1 queues and dam models; vector ARMA models including those with random coefficients and bilinear models; and both linear and non-linear state space systems with and without controls. To enhance accessibility, each chapter begins with a development of countable state space chains if appropriate. The general state space theory is then developed in close analogy, and where possible the theory is then specialized to chains on a topological state space, such as Euclidean space, so that the special structure of such spaces can be explored.

Book Overview:

The book is divided into three parts. Chains which are psi-irreducible are the focus of this book, and it is in Part I that this class of chains is initially developed. Numerous applications are described, and the foundations and basic definitions are developed directly, and illustrated through these applications. In the second part a description of the possible stable regimes for a Markov chain are described. The dichotomies which exist between transience and recurrence are developed here, and positive recurrence is described for general state space chains. Drift criteria are introduced to enable practical verification of the various forms of stability for specific models. In Part III existing and new ergodic theory is presented, and here the drift criterion approach makes its full impact. Total variation norm limit theorems, laws of large numbers, and functional central limit theorems are obtained through the combined use of drift criteria and splitting techniques.

Many of the theoretical results appear here for the first time, and much of the theory and the models which are used to illustrate the theory, and to provide extensions of the theory in special cases, have not previously been brought together in book form. This book thus provides a readable account of the development over the last two decades of a fundamental and applicable area of stochastic processes, and as such will be of value not only in probability theory but in the many discplines where these models form the basis of analysis.

This book describes the modern theory of general state space Markov chains, and the application of that theory to operations research, time series analysis, and systems and control theory. It is intended as an advanced graduate text in any of these areas, as well as being a research monograph incorporating a new and thorough treatment of the stability of general Markov chains.

There are several key themes in this book which interweave to a surprising extent in both the mathematics and its implementation. There is the use of the splitting technique, which provides an approach to general state space chains through regeneration methods; the systematic use of "Foster-Lyapunov" drift criteria, both in improving the theory and in enabling the classification of individual chains; the delineation of appropriate continuity conditions to link the general theory with the properties of chains on, in particular, Euclidean space; and the development of control model approaches, enabling analysis of models from their deterministic counterparts.

The applications cover storage systems, including some networks models as well as more traditional GI/G/1 queues and dam models; vector ARMA models including those with random coefficients and bilinear models; and both linear and non-linear state space systems with and without controls. To enhance accessibility, each chapter begins with a development of countable state space chains if appropriate. The general state space theory is then developed in close analogy, and where possible the theory is then specialized to chains on a topological state space, such as Euclidean space, so that the special structure of such spaces can be explored.

Book Overview:

The book is divided into three parts. Chains which are psi-irreducible are the focus of this book, and it is in Part I that this class of chains is initially developed. Numerous applications are described, and the foundations and basic definitions are developed directly, and illustrated through these applications. In the second part a description of the possible stable regimes for a Markov chain are described. The dichotomies which exist between transience and recurrence are developed here, and positive recurrence is described for general state space chains. Drift criteria are introduced to enable practical verification of the various forms of stability for specific models. In Part III existing and new ergodic theory is presented, and here the drift criterion approach makes its full impact. Total variation norm limit theorems, laws of large numbers, and functional central limit theorems are obtained through the combined use of drift criteria and splitting techniques.

Many of the theoretical results appear here for the first time, and much of the theory and the models which are used to illustrate the theory, and to provide extensions of the theory in special cases, have not previously been brought together in book form. This book thus provides a readable account of the development over the last two decades of a fundamental and applicable area of stochastic processes, and as such will be of value not only in probability theory but in the many discplines where these models form the basis of analysis.

Tweet

About The Author(s)

Professor and Robert C. Pittman Eminent Scholar Chair in the Department of Electrical and Computer Engineering at the University of Florida, the director of the Laboratory for Cognition & Control, and director of the Florida Institute for Sustainable Energy. Academic research interests include theory and applications of decision and control, stochastic processes, and optimization.

No information is available for this author.

Book Categories

Computer Science
45
Introduction to Computer Science
44
Algorithms and Data Structures
23
Object Oriented Programming
23
Theory of Computation
19
Formal Methods
19
Functional Programming
10
Logic Programming
22
Artificial Intelligence
22
Computer Vision
13
Big Data
4
Neural Networks
19
Compiler Design and Construction
5
Computer Security
15
Computer Organization and Architecture
8
Data Science
9
Parallel Computing
3
Concurrent Programming
22
Operating Systems
22
Data Communication and Networks
34
Information Security
6
Information Theory
23
Digital Libraries
13
Information Systems
61
Software Engineering
17
Game Development and Multimedia
12
Data Mining
23
Machine Learning

Mathematics
68
Mathematics
2
Precalculus
10
Algebra
6
Calculus
5
Category Theory
25
Linear Algebra
16
Computer Aided Mathematics
6
Proofs
17
Discrete Mathematics
6
Numerical Methods
3
Number Theory
11
Graph Theory
12
Operations Research
1
Complex Analysis
5
Queueing Theory
34
Statistics
10
Probability

Supporting Fields
9
Electric Circuits
24
Signal Processing
14
Web Design and Development
2
Document-oriented Database
9
Relational Database
2
Cloud Computing
3
Network Science

Operating System
Programming/Scripting
6
Ada
12
Assembly
34
C / C++
8
Common Lisp
2
Forth
34
Java
11
JavaScript
1
Lua
15
Microsoft .NET
1
Rexx
12
Perl
5
PHP
60
Python
7
R
1
Rebol
13
Ruby
2
Scheme
3
Tcl/Tk

Miscellaneous