Inequality has become an essential tool in many areas of mathematical research, for example in probability and statistics where it is frequently used in the proofs. "Probability Inequalities" covers inequalities related with events, distribution functions, characteristic functions, moments and random variables (elements) and their sum. The book shall serve as a useful tool and reference for scientists in the areas of probability and statistics, and applied mathematics. Prof. Zhengyan Lin is a fellow of the Institute of Mathematical Statistics and currently a professor at Zhejiang University, Hangzhou, China. He is the prize winner of National Natural Science Award of China in 1997. Prof. Zhidong Bai is a fellow of TWAS and the Institute of Mathematical Statistics; he is a professor at the National University of Singapore and Northeast Normal University, Changchun, China.

In this monograph, the author presents univariate and multivariate probabilistic inequalities with coverage on basic probabilistic entities like expectation, variance, moment generating function and covariance. These are built on the recent classical form of real analysis inequalities which are also discussed in full details. This treatise is the culmination and crystallization of the author's last two decades of research work in related discipline. Each of the chapters is self-contained and a few advanced courses can be taught out of this book. Extensive background and motivations for specific topics are given in each chapter. A very extensive list of references is also provided at the end.The topics covered in this unique book are wide-ranging and diverse. The opening chapters examine the probabilistic Ostrowski type inequalities, and various related ones, as well as the largely discusses about the Grothendieck type probabilistic inequalities. The book is also about inequalities in information theory and the Csiszar's f-Divergence between probability measures. A great section of the book is also devoted to the applications in various directions of Geometry Moment Theory. Also, the development of the Grüss type and Chebyshev-Grüss type inequalities for Stieltjes integrals and the applications in probability are explored in detail. The final chapters discuss the important real analysis methods with potential applications to stochastics. The book will be of interest to researchers and graduate students, and it is also seen as an invaluable reference book to be acquired by all science libraries as well as seminars that conduct discussions on related topics.

Describes the interplay between the probabilistic structure (independence) and a variety of tools ranging from functional inequalities to transportation arguments to information theory. Applications to the study of empirical processes, random projections, random matrix theory, and threshold phenomena are also presented.

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

Concentration inequalities, which express the fact that certain complicated random variables are almost constant, have proven of utmost importance in many areas of probability and statistics. This volume contains refined versions of these inequalities, and their relationship to many applications particularly in stochastic analysis. The broad range and the high quality of the contributions make this book highly attractive for graduates, postgraduates and researchers in the above areas.

Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical computer science will welcome the new edition of this book.” - MAA Reviews Maintaining a standard of excellence that establishes The Probabilistic Method as the leading reference on probabilistic methods in combinatorics, the Fourth Edition continues to feature a clear writing style, illustrative examples, and illuminating exercises. The new edition includes numerous updates to reflect the most recent developments and advances in discrete mathematics and the connections to other areas in mathematics, theoretical computer science, and statistical physics. Emphasizing the methodology and techniques that enable problem-solving, The Probabilistic Method, Fourth Edition begins with a description of tools applied to probabilistic arguments, including basic techniques that use expectation and variance as well as the more advanced applications of martingales and correlation inequalities. The authors explore where probabilistic techniques have been applied successfully and also examine topical coverage such as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Written by two well-known authorities in the field, the Fourth Edition features: Additional exercises throughout with hints and solutions to select problems in an appendix to help readers obtain a deeper understanding of the best methods and techniques New coverage on topics such as the Local Lemma, Six Standard Deviations result in Discrepancy Theory, Property B, and graph limits Updated sections to reflect major developments on the newest topics, discussions of the hypergraph container method, and many new references and improved results The Probabilistic Method, Fourth Edition is an ideal textbook for upper-undergraduate and graduate-level students majoring in mathematics, computer science, operations research, and statistics. The Fourth Edition is also an excellent reference for researchers and combinatorists who use probabilistic methods, discrete mathematics, and number theory. Noga Alon, PhD, is Baumritter Professor of Mathematics and Computer Science at Tel Aviv University. He is a member of the Israel National Academy of Sciences and Academia Europaea. A coeditor of the journal Random Structures and Algorithms, Dr. Alon is the recipient of the Polya Prize, The Gödel Prize, The Israel Prize, and the EMET Prize. Joel H. Spencer, PhD, is Professor of Mathematics and Computer Science at the Courant Institute of New York University. He is the cofounder and coeditor of the journal Random Structures and Algorithms and is a Sloane Foundation Fellow. Dr. Spencer has written more than 200 published articles and is the coauthor of Ramsey Theory, Second Edition, also published by Wiley.

Cryptography is one of the most active areas in current mathematics research and applications. This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.