Approximately 1,000 problems — with answers and solutions included at the back of the book — illustrate such topics as random events, random variables, limit theorems, Markov processes, and much more.
Correlation Theory of Stationary and Related Random Functions is an elementary introduction to the most important part of the theory dealing only with the first and second moments of these functions. This theory is a significant part of modern probability theory and offers both intrinsic mathematical interest and many concrete and practical applications. Stationary random functions arise in connection with stationary time series which are so important in many areas of engineering and other applications. This book presents the theory in such a way that it can be understood by readers without specialized mathematical backgrounds, requiring only the knowledge of elementary calculus. The first volume in this two-volume exposition contains the main theory; the supplementary notes and references of the second volume consist of detailed discussions of more specialized questions, some more additional material (which assumes a more thorough mathematical background than the rest of the book) and numerous references to the extensive literature.
It is well known that the normal distribution is the most pleasant, one can even say, an exemplary object in the probability theory. It combines almost all conceivable nice properties that a distribution may ever have: symmetry, stability, indecomposability, a regular tail behavior, etc. Gaussian measures (the distributions of Gaussian random functions), as infinite-dimensional analogues of tht
'Et mm. ..., si j'avait su comment en revenir, One service mathematics has rendered the je n'y serais point all':'' human race. It has put common sense back Jules Verne where it belongs, on the topmost shelf IIClI.t to the dusty canister labelled 'discarded non- The series is divergent; therefore we may be sense'. able to do something with it. Eric T. Bell O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and non linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics .. .'; 'One service logic has rendered com puter science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series.
Probability, Random Variables, and Random Processes is a comprehensive textbook on probability theory for engineers that provides a more rigorous mathematical framework than is usually encountered in undergraduate courses. It is intended for first-year graduate students who have some familiarity with probability and random variables, though not necessarily of random processes and systems that operate on random signals. It is also appropriate for advanced undergraduate students who have a strong mathematical background. The book has the following features: Several appendices include related material on integration, important inequalities and identities, frequency-domain transforms, and linear algebra. These topics have been included so that the book is relatively self-contained. One appendix contains an extensive summary of 33 random variables and their properties such as moments, characteristic functions, and entropy. Unlike most books on probability, numerous figures have been included to clarify and expand upon important points. Over 600 illustrations and MATLAB plots have been designed to reinforce the material and illustrate the various characterizations and properties of random quantities. Sufficient statistics are covered in detail, as is their connection to parameter estimation techniques. These include classical Bayesian estimation and several optimality criteria: mean-square error, mean-absolute error, maximum likelihood, method of moments, and least squares. The last four chapters provide an introduction to several topics usually studied in subsequent engineering courses: communication systems and information theory; optimal filtering (Wiener and Kalman); adaptive filtering (FIR and IIR); and antenna beamforming, channel equalization, and direction finding. This material is available electronically at the companion website. Probability, Random Variables, and Random Processes is the only textbook on probability for engineers that includes relevant background material, provides extensive summaries of key results, and extends various statistical techniques to a range of applications in signal processing.
This is the first systematic exposition of random sets theory since Matheron (1975), with full proofs, exhaustive bibliographies and literature notes Interdisciplinary connections and applications of random sets are emphasized throughout the book An extensive bibliography in the book is available on the Web at http://liinwww.ira.uka.de/bibliography/math/random.closed.sets.html, and is accompanied by a search engine
A one-year course in probability theory and the theory of random processes, taught at Princeton University to undergraduate and graduate students, forms the core of this book. It provides a comprehensive and self-contained exposition of classical probability theory and the theory of random processes. The book includes detailed discussion of Lebesgue integration, Markov chains, random walks, laws of large numbers, limit theorems, and their relation to Renormalization Group theory. It also includes the theory of stationary random processes, martingales, generalized random processes, and Brownian motion.
For many practical problems, observations are not independent. In this book, limit behaviour of an important kind of dependent random variables, the so-called mixing random variables, is studied. Many profound results are given, which cover recent developments in this subject, such as basic properties of mixing variables, powerful probability and moment inequalities, weak convergence and strong convergence (approximation), limit behaviour of some statistics with a mixing sample, and many useful tools are provided. Audience: This volume will be of interest to researchers and graduate students in the field of probability and statistics, whose work involves dependent data (variables).
Hash functions are the cryptographer’s Swiss Army knife. Even though they play an integral part in today’s cryptography, existing textbooks discuss hash functions only in passing and instead often put an emphasis on other primitives like encryption schemes. In this book the authors take a different approach and place hash functions at the center. The result is not only an introduction to the theory of hash functions and the random oracle model but a comprehensive introduction to modern cryptography. After motivating their unique approach, in the first chapter the authors introduce the concepts from computability theory, probability theory, information theory, complexity theory, and information-theoretic security that are required to understand the book content. In Part I they introduce the foundations of hash functions and modern cryptography. They cover a number of schemes, concepts, and proof techniques, including computational security, one-way functions, pseudorandomness and pseudorandom functions, game-based proofs, message authentication codes, encryption schemes, signature schemes, and collision-resistant (hash) functions. In Part II the authors explain the random oracle model, proof techniques used with random oracles, random oracle constructions, and examples of real-world random oracle schemes. They also address the limitations of random oracles and the random oracle controversy, the fact that uninstantiable schemes exist which are provably secure in the random oracle model but which become insecure with any real-world hash function. Finally in Part III the authors focus on constructions of hash functions. This includes a treatment of iterative hash functions and generic attacks against hash functions, constructions of hash functions based on block ciphers and number-theoretic assumptions, a discussion of privately keyed hash functions including a full security proof for HMAC, and a presentation of real-world hash functions. The text is supported with exercises, notes, references, and pointers to further reading, and it is a suitable textbook for undergraduate and graduate students, and researchers of cryptology and information security.
The long-awaited revision of Fundamentals of Applied Probability and Random Processes expands on the central components that made the first edition a classic. The title is based on the premise that engineers use probability as a modeling tool, and that probability can be applied to the solution of engineering problems. Engineers and students studying probability and random processes also need to analyze data, and thus need some knowledge of statistics. This book is designed to provide students with a thorough grounding in probability and stochastic processes, demonstrate their applicability to real-world problems, and introduce the basics of statistics. The book's clear writing style and homework problems make it ideal for the classroom or for self-study. - Demonstrates concepts with more than 100 illustrations, including 2 dozen new drawings - Expands readers' understanding of disruptive statistics in a new chapter (chapter 8) - Provides new chapter on Introduction to Random Processes with 14 new illustrations and tables explaining key concepts. - Includes two chapters devoted to the two branches of statistics, namely descriptive statistics (chapter 8) and inferential (or inductive) statistics (chapter 9).