This engaging introduction to random processes provides students with the critical tools needed to design and evaluate engineering systems that must operate reliably in uncertain environments. A brief review of probability theory and real analysis of deterministic functions sets the stage for understanding random processes, whilst the underlying measure theoretic notions are explained in an intuitive, straightforward style. Students will learn to manage the complexity of randomness through the use of simple classes of random processes, statistical means and correlations, asymptotic analysis, sampling, and effective algorithms. Key topics covered include: • Calculus of random processes in linear systems • Kalman and Wiener filtering • Hidden Markov models for statistical inference • The estimation maximization (EM) algorithm • An introduction to martingales and concentration inequalities. Understanding of the key concepts is reinforced through over 100 worked examples and 300 thoroughly tested homework problems (half of which are solved in detail at the end of the book).

Point processes and random measures find wide applicability in telecommunications, earthquakes, image analysis, spatial point patterns, and stereology, to name but a few areas. The authors have made a major reshaping of their work in their first edition of 1988 and now present their Introduction to the Theory of Point Processes in two volumes with sub-titles Elementary Theory and Models and General Theory and Structure. Volume One contains the introductory chapters from the first edition, together with an informal treatment of some of the later material intended to make it more accessible to readers primarily interested in models and applications. The main new material in this volume relates to marked point processes and to processes evolving in time, where the conditional intensity methodology provides a basis for model building, inference, and prediction. There are abundant examples whose purpose is both didactic and to illustrate further applications of the ideas and models that are the main substance of the text.

Stochastic processes are mathematical models of random phenomena that evolve according to prescribed dynamics. Processes commonly used in applications are Markov chains in discrete and continuous time, renewal and regenerative processes, Poisson processes, and Brownian motion. This volume gives an in-depth description of the structure and basic properties of these stochastic processes. A main focus is on equilibrium distributions, strong laws of large numbers, and ordinary and functional central limit theorems for cost and performance parameters. Although these results differ for various processes, they have a common trait of being limit theorems for processes with regenerative increments. Extensive examples and exercises show how to formulate stochastic models of systems as functions of a system’s data and dynamics, and how to represent and analyze cost and performance measures. Topics include stochastic networks, spatial and space-time Poisson processes, queueing, reversible processes, simulation, Brownian approximations, and varied Markovian models. The technical level of the volume is between that of introductory texts that focus on highlights of applied stochastic processes, and advanced texts that focus on theoretical aspects of processes.

A self-contained and coherent account of probabilistic techniques, covering: distance measures, kernel rules, nearest neighbour rules, Vapnik-Chervonenkis theory, parametric classification, and feature extraction. Each chapter concludes with problems and exercises to further the readers understanding. Both research workers and graduate students will benefit from this wide-ranging and up-to-date account of a fast- moving field.

This second edition has a unique approach that provides a broad and wide introduction into the fascinating area of probability theory. It starts on a fast track with the treatment of probability theory and stochastic processes by providing short proofs. The last chapter is unique as it features a wide range of applications in other fields like Vlasov dynamics of fluids, statistics of circular data, singular continuous random variables, Diophantine equations, percolation theory, random Schrödinger operators, spectral graph theory, integral geometry, computer vision, and processes with high risk.Many of these areas are under active investigation and this volume is highly suited for ambitious undergraduate students, graduate students and researchers.

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.

This introductory textbook is designed for a one-semester course on queueing theory that does not require a course on stochastic processes as a prerequisite. By integrating the necessary background on stochastic processes with the analysis of models, the work provides a sound foundational introduction to the modeling and analysis of queueing systems for a broad interdisciplinary audience of students in mathematics, statistics, and applied disciplines such as computer science, operations research, and engineering. This edition includes additional topics in methodology and applications. Key features: • An introductory chapter including a historical account of the growth of queueing theory in more than 100 years. • A modeling-based approach with emphasis on identification of models • Rigorous treatment of the foundations of basic models commonly used in applications with appropriate references for advanced topics. • A chapter on matrix-analytic method as an alternative to the traditional methods of analysis of queueing systems. • A comprehensive treatment of statistical inference for queueing systems. • Modeling exercises and review exercises when appropriate. The second edition of An Introduction of Queueing Theory may be used as a textbook by first-year graduate students in fields such as computer science, operations research, industrial and systems engineering, as well as related fields such as manufacturing and communications engineering. Upper-level undergraduate students in mathematics, statistics, and engineering may also use the book in an introductory course on queueing theory. With its rigorous coverage of basic material and extensive bibliography of the queueing literature, the work may also be useful to applied scientists and practitioners as a self-study reference for applications and further research. "...This book has brought a freshness and novelty as it deals mainly with modeling and analysis in applications as well as with statistical inference for queueing problems. With his 40 years of valuable experience in teaching and high level research in this subject area, Professor Bhat has been able to achieve what he aimed: to make [the work] somewhat different in content and approach from other books." - Assam Statistical Review of the first edition