This book is a survey of work on passage times in stable Markov chains with a discrete state space and a continuous time. Passage times have been investigated since early days of probability theory and its applications. The best known example is the first entrance time to a set, which embraces waiting times, busy periods, absorption problems, extinction phenomena, etc. Another example of great interest is the last exit time from a set. The book presents a unifying treatment of passage times, written in a systematic manner and based on modern developments. The appropriate unifying framework is provided by probabilistic potential theory, and the results presented in the text are interpreted from this point of view. In particular, the crucial role of the Dirichlet problem and the Poisson equation is stressed. The work is addressed to applied probalilists, and to those who are interested in applications of probabilistic methods in their own areas of interest. The level of presentation is that of a graduate text in applied stochastic processes. Hence, clarity of presentation takes precedence over secondary mathematical details whenever no serious harm may be expected. Advanced concepts described in the text gain nowadays growing acceptance in applied fields, and it is hoped that this work will serve as an useful introduction. Abstracted by Mathematical Reviews, issue 94c

Primarily an introduction to the theory of stochastic processes at the undergraduate or beginning graduate level, the primary objective of this book is to initiate students in the art of stochastic modelling. However it is motivated by significant applications and progressively brings the student to the borders of contemporary research. Examples are from a wide range of domains, including operations research and electrical engineering. Researchers and students in these areas as well as in physics, biology and the social sciences will find this book of interest.

Matrix-analytic methods are fundamental to the analysis of a family of Markov processes rich in structure and of wide applicability. They are extensively used in the modelling and performance analysis of computer systems, telecommunication networks, network protocols and many other stochastic systems of current commercial and engineering interest.This volume deals with: (1) various aspects of the theory of block-structured Markov chains; (2) analysis of complex queueing models; and (3) parameter estimation and specific applications to such areas as cellular mobile systems, FS-ALOHA, the Internet and production systems.

This open access book shows how to use sensitivity analysis in demography. It presents new methods for individuals, cohorts, and populations, with applications to humans, other animals, and plants. The analyses are based on matrix formulations of age-classified, stage-classified, and multistate population models. Methods are presented for linear and nonlinear, deterministic and stochastic, and time-invariant and time-varying cases. Readers will discover results on the sensitivity of statistics of longevity, life disparity, occupancy times, the net reproductive rate, and statistics of Markov chain models in demography. They will also see applications of sensitivity analysis to population growth rates, stable population structures, reproductive value, equilibria under immigration and nonlinearity, and population cycles. Individual stochasticity is a theme throughout, with a focus that goes beyond expected values to include variances in demographic outcomes. The calculations are easily and accurately implemented in matrix-oriented programming languages such as Matlab or R. Sensitivity analysis will help readers create models to predict the effect of future changes, to evaluate policy effects, and to identify possible evolutionary responses to the environment. Complete with many examples of the application, the book will be of interest to researchers and graduate students in human demography and population biology. The material will also appeal to those in mathematical biology and applied mathematics.

Stochastic processes are found in probabilistic systems that evolve with time. Discrete stochastic processes change by only integer time steps (for some time scale), or are characterized by discrete occurrences at arbitrary times. Discrete Stochastic Processes helps the reader develop the understanding and intuition necessary to apply stochastic process theory in engineering, science and operations research. The book approaches the subject via many simple examples which build insight into the structure of stochastic processes and the general effect of these phenomena in real systems. The book presents mathematical ideas without recourse to measure theory, using only minimal mathematical analysis. In the proofs and explanations, clarity is favored over formal rigor, and simplicity over generality. Numerous examples are given to show how results fail to hold when all the conditions are not satisfied. Audience: An excellent textbook for a graduate level course in engineering and operations research. Also an invaluable reference for all those requiring a deeper understanding of the subject.

Markov chains are central to the understanding of random processes. This is not only because they pervade the applications of random processes, but also because one can calculate explicitly many quantities of interest. This textbook, aimed at advanced undergraduate or MSc students with some background in basic probability theory, focuses on Markov chains and quickly develops a coherent and rigorous theory whilst showing also how actually to apply it. Both discrete-time and continuous-time chains are studied. A distinguishing feature is an introduction to more advanced topics such as martingales and potentials in the established context of Markov chains. There are applications to simulation, economics, optimal control, genetics, queues and many other topics, and exercises and examples drawn both from theory and practice. It will therefore be an ideal text either for elementary courses on random processes or those that are more oriented towards applications.