Probabilistic Analysis and Related Topics, Volume 3 focuses on the continuity, integrability, and differentiability of random functions, including operator theory, measure theory, and functional and numerical analysis. The selection first offers information on the qualitative theory of stochastic systems and Langevin equations with multiplicative noise. Discussions focus on phase-space evolution via direct integration, phase-space evolution, linear and nonlinear systems, linearization, and generalizations. The text then ponders on the stability theory of stochastic difference systems and Markov properties for random fields. Topics include Markov property of solutions of stochastic partial differential equations; Markov property for generalized Gaussian random fields; Markov properties for generalized random fields; stochastic stability of nonlinear systems; and linear stochastic systems. The publication examines the method of random contractors and its applications to random nonlinear equations, including integral contractors and applications to random equations; random contractors with random nonlinear majorant functions; and random contractors and application to random nonlinear operator equations. The selection is a valuable reference for mathematicians and researchers interested in the general theory of random functions.

Randomization and probabilistic techniques play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communication networks and secure protocols. This 2005 textbook is designed to accompany a one- or two-semester course for advanced undergraduates or beginning graduate students in computer science and applied mathematics. It gives an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It assumes only an elementary background in discrete mathematics and gives a rigorous yet accessible treatment of the material, with numerous examples and applications. The first half of the book covers core material, including random sampling, expectations, Markov's inequality, Chevyshev's inequality, Chernoff bounds, the probabilistic method and Markov chains. The second half covers more advanced topics such as continuous probability, applications of limited independence, entropy, Markov chain Monte Carlo methods and balanced allocations. With its comprehensive selection of topics, along with many examples and exercises, this book is an indispensable teaching tool.

Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the worst-case or average-case analyses. This book surveys both of these emerging areas on the interface of the mathematical sciences and computer science. It is designed to attract new researchers to this area and provide them with enough background to begin explorations of their own.

In recent years, there has been an upsurge of interest in using techniques drawn from probability to tackle problems in analysis. These applications arise in subjects such as potential theory, harmonic analysis, singular integrals, and the study of analytic functions. This book presents a modern survey of these methods at the level of a beginning Ph.D. student. Highlights of this book include the construction of the Martin boundary, probabilistic proofs of the boundary Harnack principle, Dahlberg's theorem, a probabilistic proof of Riesz' theorem on the Hilbert transform, and Makarov's theorems on the support of harmonic measure. The author assumes that a reader has some background in basic real analysis, but the book includes proofs of all the results from probability theory and advanced analysis required. Each chapter concludes with exercises ranging from the routine to the difficult. In addition, there are included discussions of open problems and further avenues of research.

A detailed and up-to-date introduction to machine learning, presented through the unifying lens of probabilistic modeling and Bayesian decision theory. This book offers a detailed and up-to-date introduction to machine learning (including deep learning) through the unifying lens of probabilistic modeling and Bayesian decision theory. The book covers mathematical background (including linear algebra and optimization), basic supervised learning (including linear and logistic regression and deep neural networks), as well as more advanced topics (including transfer learning and unsupervised learning). End-of-chapter exercises allow students to apply what they have learned, and an appendix covers notation. Probabilistic Machine Learning grew out of the author’s 2012 book, Machine Learning: A Probabilistic Perspective. More than just a simple update, this is a completely new book that reflects the dramatic developments in the field since 2012, most notably deep learning. In addition, the new book is accompanied by online Python code, using libraries such as scikit-learn, JAX, PyTorch, and Tensorflow, which can be used to reproduce nearly all the figures; this code can be run inside a web browser using cloud-based notebooks, and provides a practical complement to the theoretical topics discussed in the book. This introductory text will be followed by a sequel that covers more advanced topics, taking the same probabilistic approach.

Using only the very elementary framework of finite probability spaces, this book treats a number of topics in the modern theory of stochastic processes. This is made possible by using a small amount of Abraham Robinson's nonstandard analysis and not attempting to convert the results into conventional form.

This two-volume book offers a comprehensive treatment of the probabilistic approach to mean field game models and their applications. The book is self-contained in nature and includes original material and applications with explicit examples throughout, including numerical solutions. Volume I of the book is entirely devoted to the theory of mean field games without a common noise. The first half of the volume provides a self-contained introduction to mean field games, starting from concrete illustrations of games with a finite number of players, and ending with ready-for-use solvability results. Readers are provided with the tools necessary for the solution of forward-backward stochastic differential equations of the McKean-Vlasov type at the core of the probabilistic approach. The second half of this volume focuses on the main principles of analysis on the Wasserstein space. It includes Lions' approach to the Wasserstein differential calculus, and the applications of its results to the analysis of stochastic mean field control problems. Together, both Volume I and Volume II will greatly benefit mathematical graduate students and researchers interested in mean field games. The authors provide a detailed road map through the book allowing different access points for different readers and building up the level of technical detail. The accessible approach and overview will allow interested researchers in the applied sciences to obtain a clear overview of the state of the art in mean field games.

An integrated package of powerful probabilistic tools and key applications in modern mathematical data science.

Probabilistic Analysis of Algorithms begins with a presentation of the "tools of the trade" currently used in probabilistic analyses, and continues with an applications section in which these tools are used in the analysis ofr selected algorithms. The tools section of the book provides the reader with an arsenal of analytic and numeric computing methods which are then applied to several groups of algorithms to analyze their running time or storage requirements characteristics. Topics covered in the applications section include sorting, communications network protocols and bin packing. While the discussion of the various algorithms is sufficient to motivate their structure, the emphasis throughout is on the probabilistic estimation of their operation under distributional assumptions on their input. Probabilistic Analysis of Algorithms assumes a working knowledge of engineering mathematics, drawing on real and complex analysis, combinatorics and probability theory. While the book is intended primarily as a text for the upper undergraduate and graduate student levels, it contains a wealth of material and should also prove an important reference for researchers. As such it is addressed to computer scientists, mathematicians, operations researchers, and electrical and industrial engineers who are interested in evaluating the probable operation of algorithms, rather than their worst-case behavior.