Explore the vast range of titles available.

This book gives a comprehensive and self-contained introduction to the theory of symmetric Markov processes and symmetric quasi-regular Dirichlet forms. In a detailed and accessible manner, Zhen-Qing Chen and Masatoshi Fukushima cover the essential elements and applications of the theory of symmetric Markov processes, including recurrence/transience criteria, probabilistic potential theory, additive functional theory, and time change theory. The authors develop the theory in a general framework of symmetric quasi-regular Dirichlet forms in a unified manner with that of regular Dirichlet forms, emphasizing the role of extended Dirichlet spaces and the rich interplay between the probabilistic and analytic aspects of the theory. Chen and Fukushima then address the latest advances in the theory, presented here for the first time in any book. Topics include the characterization of time-changed Markov processes in terms of Douglas integrals and a systematic account of reflected Dirichlet spaces, and the important roles such advances play in the boundary theory of symmetric Markov processes. This volume is an ideal resource for researchers and practitioners, and can also serve as a textbook for advanced graduate students. It includes examples, appendixes, and exercises with solutions.

Random matrix theory, both as an application and as a theory, has evolved rapidly over the past fifteen years.Log-Gases and Random Matricesgives a comprehensive account of these developments, emphasizing log-gases as a physical picture and heuristic, as well as covering topics such as beta ensembles and Jack polynomials. Peter Forrester presents an encyclopedic development of log-gases and random matrices viewed as examples of integrable or exactly solvable systems. Forrester develops not only the application and theory of Gaussian and circular ensembles of classical random matrix theory, but also of the Laguerre and Jacobi ensembles, and their beta extensions. Prominence is given to the computation of a multitude of Jacobians; determinantal point processes and orthogonal polynomials of one variable; the Selberg integral, Jack polynomials, and generalized hypergeometric functions; Painlevé transcendents; macroscopic electrostatistics and asymptotic formulas; nonintersecting paths and models in statistical mechanics; and applications of random matrix theory. This is the first textbook development of both nonsymmetric and symmetric Jack polynomial theory, as well as the connection between Selberg integral theory and beta ensembles. The author provides hundreds of guided exercises and linked topics, makingLog-Gases and Random Matricesan indispensable reference work, as well as a learning resource for all students and researchers in the field.

A comprehensive introduction to the core issues of stochastic differential equations and their effective application Introduction to Stochastic Differential Equations with Applications to Modelling in Biology and Finance offers a comprehensive examination to the most important issues of stochastic differential equations and their applications.

Comprehensively teaches the basics of testing statistical assumptions in research and the importance in doing so This book facilitates researchers in checking the assumptions of statistical tests used in their research by focusing on the importance of checking assumptions in using statistical methods, showing them how to check assumptions, and.

In recent years, applications of advanced stochastic processes have expanded greatly. Intended for students taking a second course in stochastic processes, this textbook presents an overview of theory with applications in engineering and science. This book covers key topics such as ergodicity, crossing problems, and extremes, and opens the doors to a selection of special topics for the teacher to expand on, like extreme value theory, filter theory, long-range dependence, and point processes, and includes many exercises and examples to illustrate the theory.

Explores methods for the representation and treatment of uncertainty in risk assessment In providing guidance for practical decision-making situations concerning high-consequence technologies (e.g., nuclear, oil and gas, transport, etc.), the theories and methods studied in Uncertainty in Risk Assessment have wide-ranging applications from engineering and medicine to environmental impacts and natural disasters, security, and financial risk management. The main focus, however, is on engineering applications. While requiring some fundamental background in risk assessment, as well as a basic knowledge of probability theory and statistics, Uncertainty in Risk Assessment can be read profitably by a broad audience of professionals in the field, including researchers and graduate students on courses within risk analysis, statistics, engineering, and the physical sciences. Uncertainty in Risk Assessment: * Illustrates the need for seeing beyond probability to represent uncertainties in risk assessment contexts. * Provides simple explanations (supported by straightforward numerical examples) of the meaning of different types of probabilities, including interval probabilities, and the fundamentals of possibility theory and evidence theory. * Offers guidance on when to use probability and when to use an alternative representation of uncertainty. * Presents and discusses methods for the representation and characterization of uncertainty in risk assessment. * Uses examples to clearly illustrate ideas and concepts.

A much-needed introduction to the field of discrete-valued time series, with a focus on count-data time series Time series analysis is an essential tool in a wide array of fields, including business, economics, computer science, epidemiology, finance, manufacturing and meteorology, to name just a few. Despite growing interest in discrete-valued time series—especially those arising from counting specific objects or events at specified times—most books on time series give short shrift to that increasingly important subject area. This book seeks to rectify that state of affairs by providing a much needed introduction to discrete-valued time series, with particular focus on count-data time series. The main focus of this book is on modeling. Throughout numerous examples are provided illustrating models currently used in discrete-valued time series applications. Statistical process control, including various control charts (such as cumulative sum control charts), and performance evaluation are treated at length. Classic approaches like ARMA models and the Box-Jenkins program are also featured with the basics of these approaches summarized in an Appendix. In addition, data examples, with all relevant R code, are available on a companion website. • Provides a balanced presentation of theory and practice, exploring both categorical and integer-valued series • Covers common models for time series of counts as well as for categorical time series, and works out their most important stochastic properties • Addresses statistical approaches for analyzing discrete-valued time series and illustrates their implementation with numerous data examples • Covers classical approaches such as ARMA models, Box-Jenkins program and how to generate functions • Includes dataset examples with all necessary R code provided on a companion website An Introduction to Discrete-Valued Time Series is a valuable working resource for researchers and practitioners in a broad range of fields, including statistics, data science, machine learning, and engineering. It will also be of interest to postgraduate students in statistics, mathematics and economics.

Bayes' rule appears to be a straightforward, one-line theorem: by updating our initial beliefs with objective new information, we get a new and improved belief. To its adherents, it is an elegant statement about learning from experience. To its opponents, it is subjectivity run amok. In the first-ever account of Bayes' rule for general readers, Sharon Bertsch McGrayne explores this controversial theorem and the human obsessions surrounding it. She traces its discovery by an amateur mathematician in the 1740s through its development into roughly its modern form by French scientist Pierre Simon Laplace. She reveals why respected statisticians rendered it professionally taboo for 150 years-at the same time that practitioners relied on it to solve crises involving great uncertainty and scanty information (Alan Turing's role in breaking Germany's Enigma code during World War II), and explains how the advent of off-the-shelf computer technology in the 1980s proved to be a game-changer. Today, Bayes' rule is used everywhere from DNA de-coding to Homeland Security. Drawing on primary source material and interviews with statisticians and other scientists,The Theory That Would Not Dieis the riveting account of how a seemingly simple theorem ignited one of the greatest controversies of all time.

A fascinating and instructive guide to Markov chains for experienced users and newcomers alike This unique guide to Markov chains approaches the subject along the four convergent lines of mathematics, implementation, simulation, and experimentation. It introduces readers to the art of stochastic modeling, shows how to design computer implementations, and provides extensive worked examples with case studies. Markov Chains: From Theory to Implementation and Experimentation begins with a general introduction to the history of probability theory in which the author uses quantifiable examples to illustrate how probability theory arrived at the concept of discrete-time and the Markov model from experiments involving independent variables. An introduction to simple stochastic matrices and transition probabilities is followed by a simulation of a two-state Markov chain. The notion of steady state is explored in connection with the long-run distribution behavior of the Markov chain. Predictions based on Markov chains with more than two states are examined, followed by a discussion of the notion of absorbing Markov chains. Also covered in detail are topics relating to the average time spent in a state, various chain configurations, and n-state Markov chain simulations used for verifying experiments involving various diagram configurations. • Fascinating historical notes shed light on the key ideas that led to the development of the Markov model and its variants • Various configurations of Markov Chains and their limitations are explored at length • Numerous examples—from basic to complex—are presented in a comparative manner using a variety of color graphics • All algorithms presented can be analyzed in either Visual Basic, Java Script, or PHP • Designed to be useful to professional statisticians as well as readers without extensive knowledge of probability theory Covering both the theory underlying the Markov model and an array of Markov chain implementations, within a common conceptual framework, Markov Chains: From Theory to Implementation and Experimentation is a stimulating introduction to and a valuable reference for those wishing to deepen their understanding of this extremely valuable statistical tool. Paul A. Gagniuc, PhD, is Associate Professor at Polytechnic University of Bucharest, Romania. He obtained his MS and his PhD in genetics at the University of Bucharest. Dr. Gagniuc's work has been published in numerous high profile scientific journals, ranging from the Public Library of Science to BioMed Central and Nature journals. He is the recipient of several awards for exceptional scientific results and a highly active figure in the review process for different scientific areas.

Deterministic network calculus is a theory based on the (min, plus) algebra. Its aim is to compute worst-case performance bounds in communication networks. Our goal is to provide a comprehensive view of this theory and its recent advances, from its theoretical foundations to its implementations. The book is divided into three parts. The first part focuses on the (min, plus) framework and its algorithmic aspects. The second part defines the network calculus model and analyzes one server in isolation. Different service and scheduling policies are discussed, particularly when data is packetized. The third part is about network analyses. Pay burst only once and pay multiplexing only once phenomena are exhibited, and different analyses are proposed and compared. This includes the linear programming approaches that compute tight performance bounds. Finally, some partial results on the stability are detailed.