Finite Markov Processes And Their Applications

A self-contained treatment of finite Markov chains and processes, this text covers both theory and applications. Author Marius Iosifescu, vice president of the Romanian Academy and director of its Center for Mathematical Statistics, begins with a review of relevant aspects of probability theory and linear algebra. Experienced readers may start with the second chapter, a treatment of fundamental concepts of homogeneous finite Markov chain theory that offers examples of applicable models. The text advances to studies of two basic types of homogeneous finite Markov chains: absorbing and ergodic chains. A complete study of the general properties of homogeneous chains follows. Succeeding chapters examine the fundamental role of homogeneous infinite Markov chains in mathematical modeling employed in the fields of psychology and genetics; the basics of nonhomogeneous finite Markov chain theory; and a study of Markovian dependence in continuous time, which constitutes an elementary introduction to the study of continuous parameter stochastic processes.

Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding.

This graduate-level text and reference in probability, with numerous applications to several fields of science, presents nonmeasure-theoretic introduction to theory of Markov processes. The work also covers mathematical models based on the theory, employed in various applied fields. Prerequisites are a knowledge of elementary probability theory, mathematical statistics, and analysis. Appendixes. Bibliographies. 1960 edition.

Semi-Markov Processes: Applications in System Reliability and Maintenance is a modern view of discrete state space and continuous time semi-Markov processes and their applications in reliability and maintenance. The book explains how to construct semi-Markov models and discusses the different reliability parameters and characteristics that can be obtained from those models. The book is a useful resource for mathematicians, engineering practitioners, and PhD and MSc students who want to understand the basic concepts and results of semi-Markov process theory. Clearly defines the properties and theorems from discrete state Semi-Markov Process (SMP) theory Describes the method behind constructing Semi-Markov (SM) models and SM decision models in the field of reliability and maintenance Provides numerous individual versions of SM models, including the most recent and their impact on system reliability and maintenance

An extension problem (often called a boundary problem) of Markov processes has been studied, particularly in the case of one-dimensional diffusion processes, by W. Feller, K. Itô, and H. P. McKean, among others. In this book, Itô discussed a case of a general Markov process with state space S and a specified point a ∈ S called a boundary. The problem is to obtain all possible recurrent extensions of a given minimal process (i.e., the process on S \ {a} which is absorbed on reaching the boundary a). The study in this lecture is restricted to a simpler case of the boundary a being a discontinuous entrance point, leaving a more general case of a continuous entrance point to future works. He established a one-to-one correspondence between a recurrent extension and a pair of a positive measure k(db) on S \ {a} (called the jumping-in measure and a non-negative number m

This book is the result of the International Symposium on Semi Markov Processes and their Applications held on June 4-7, 1984 at the Universite Libre de Bruxelles with the help of the FNRS (Fonds National de la Recherche Scientifique, Belgium), the Ministere de l'Education Nationale (Belgium) and the Bernoulli Society for Mathe matical Statistics and Probability. This international meeting was planned to make a state of the art for the area of semi-Markov theory and its applications, to bring together researchers in this field and to create a platform for open and thorough discussion. Main themes of the Symposium are the first ten sections of this book. The last section presented here gives an exhaustive biblio graphy on semi-Markov processes for the last ten years. Papers selected for this book are all invited papers and in addition some contributed papers retained after strong refereeing. Sections are I. Markov additive processes and regenerative systems II. Semi-Markov decision processes III. Algorithmic and computer-oriented approach IV. Semi-Markov models in economy and insurance V. Semi-Markov processes and reliability theory VI. Simulation and statistics for semi-Markov processes VII. Semi-Markov processes and queueing theory VIII. Branching IX. Applications in medicine X. Applications in other fields v PREFACE XI. A second bibliography on semi-Markov processes It is interesting to quote that sections IV to X represent a good sample of the main applications of semi-Markov processes i. e.

Provides a more accessible introduction than other books on Markov processes by emphasizing the structure of the subject and avoiding sophisticated measure theory Leads the reader to a rigorous understanding of basic theory

Onishchik, A. A. Kirillov, and E. B. Vinberg, who obtained their first results on Lie groups in Dynkin's seminar. At a later stage, the work of the seminar was greatly enriched by the active participation of 1. 1. Pyatetskii Shapiro. As already noted, Dynkin started to work in probability as far back as his undergraduate studies. In fact, his first published paper deals with a problem arising in Markov chain theory. The most significant among his earliest probabilistic results concern sufficient statistics. In [15] and [17], Dynkin described all families of one-dimensional probability distributions admitting non-trivial sufficient statistics. These papers have considerably influenced the subsequent research in this field. But Dynkin's most famous results in probability concern the theory of Markov processes. Following Kolmogorov, Feller, Doob and Ito, Dynkin opened a new chapter in the theory of Markov processes. He created the fundamental concept of a Markov process as a family of measures corresponding to var ious initial times and states and he defined time homogeneous processes in terms of the shift operators ()t. In a joint paper with his student A.