Most probability problems involve random variables indexed by space and/or time. These problems almost always have  a version in which space and/or time are taken to be discrete. This volume deals with areas in which the discrete version is more natural than the continuous one, perhaps even the only one than can be formulated without complicated constructions and machinery. The 5 papers of this volume discuss problems in which there has been significant progress in the last few years; they are motivated by, or have been developed in parallel with, statistical physics. They include questions about asymptotic shape for stochastic growth models and for random clusters; existence, location and properties of phase transitions; speed of convergence to equilibrium in Markov chains, and in particular for Markov chains based on models with a phase transition; cut-off phenomena for random walks. The articles can be read independently of each other. Their unifying theme is that of models built on discrete spaces or graphs. Such models are often easy to formulate. Correspondingly, the book requires comparatively little previous knowledge of the machinery of probability.

Volume II of this two-volume text and reference work concentrates on the applications of probability theory to statistics, e.g., the art of calculating densities of complicated transformations of random vectors, exponential models, consistency of maximum estimators, and asymptotic normality of maximum estimators. It also discusses topics of a pure probabilistic nature, such as stochastic processes, regular conditional probabilities, strong Markov chains, random walks, and optimal stopping strategies in random games. Unusual topics include the transformation theory of densities using Hausdorff measures, the consistency theory using the upper definition function, and the asymptotic normality of maximum estimators using twice stochastic differentiability. With an emphasis on applications to statistics, this is a continuation of the first volume, though it may be used independently of that book. Assuming a knowledge of linear algebra and analysis, as well as a course in modern probability, Volume II looks at statistics from a probabilistic point of view, touching only slightly on the practical computation aspects.

Volume I of this two-volume text and reference work begins by providing a foundation in measure and integration theory. It then offers a systematic introduction to probability theory, and in particular, those parts that are used in statistics. This volume discusses the law of large numbers for independent and non-independent random variables, transforms, special distributions, convergence in law, the central limit theorem for normal and infinitely divisible laws, conditional expectations and martingales. Unusual topics include the uniqueness and convergence theorem for general transforms with characteristic functions, Laplace transforms, moment transforms and generating functions as special examples. The text contains substantive applications, e.g., epidemic models, the ballot problem, stock market models and water reservoir models, and discussion of the historical background. The exercise sets contain a variety of problems ranging from simple exercises to extensions of the theory. Volume II of this two-volume text and reference work concentrates on the applications of probability theory to statistics, e.g., the art of calculating densities of complicated transformations of random vectors, exponential models, consistency of maximum estimators, and asymptotic normality of maximum estimators. It also discusses topics of a pure probabilistic nature, such as stochastic processes, regular conditional probabilities, strong Markov chains, random walks, and optimal stopping strategies in random games. Unusual topics include the transformation theory of densities using Hausdorff measures, the consistency theory using the upper definition function, and the asymptotic normality of maximum estimators using twice stochastic differentiability. With an emphasis on applications to statistics, this is a continuation of the first volume, though it may be used independently of that book. Assuming a knowledge of linear algebra and analysis, as well as a course in modern probability, Volume II looks at statistics from a probabilistic point of view, touching only slightly on the practical computation aspects.

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.

Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.

Most probability problems involve random variables indexed by space and/or time. These problems almost always have a version in which space and/or time are taken to be discrete. This volume deals with areas in which the discrete version is more natural than the continuous one, perhaps even the only one than can be formulated without complicated constructions and machinery. The 5 papers of this volume discuss problems in which there has been significant progress in the last few years; they are motivated by, or have been developed in parallel with, statistical physics. They include questions about asymptotic shape for stochastic growth models and for random clusters; existence, location and properties of phase transitions; speed of convergence to equilibrium in Markov chains, and in particular for Markov chains based on models with a phase transition; cut-off phenomena for random walks. The articles can be read independently of each other. Their unifying theme is that of models built on discrete spaces or graphs. Such models are often easy to formulate. Correspondingly, the book requires comparatively little previous knowledge of the machinery of probability.

Stochastic calculus has important applications to mathematical finance. This book will appeal to practitioners and students who want an elementary introduction to these areas.

From the reviews: "As the preface says, 'This is a text with an attitude, and it is designed to reflect, wherever possible and appropriate, a prejudice for the concrete over the abstract'. This is also reflected in the style of writing which is unusually lively for a mathematics book." --ZENTRALBLATT MATH

This lively, problem-oriented text, first published in 2004, is designed to coach readers toward mastery of the most fundamental mathematical inequalities. With the Cauchy-Schwarz inequality as the initial guide, the reader is led through a sequence of fascinating problems whose solutions are presented as they might have been discovered - either by one of history's famous mathematicians or by the reader. The problems emphasize beauty and surprise, but along the way readers will find systematic coverage of the geometry of squares, convexity, the ladder of power means, majorization, Schur convexity, exponential sums, and the inequalities of Hoelder, Hilbert, and Hardy. The text is accessible to anyone who knows calculus and who cares about solving problems. It is well suited to self-study, directed study, or as a supplement to courses in analysis, probability, and combinatorics.

This lively, problem-oriented text, first published in 2004, is designed to coach readers toward mastery of the most fundamental mathematical inequalities. With the Cauchy-Schwarz inequality as the initial guide, the reader is led through a sequence of fascinating problems whose solutions are presented as they might have been discovered - either by one of history's famous mathematicians or by the reader. The problems emphasize beauty and surprise, but along the way readers will find systematic coverage of the geometry of squares, convexity, the ladder of power means, majorization, Schur convexity, exponential sums, and the inequalities of Hoelder, Hilbert, and Hardy. The text is accessible to anyone who knows calculus and who cares about solving problems. It is well suited to self-study, directed study, or as a supplement to courses in analysis, probability, and combinatorics.

This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. Much attention is paid to those questions dealing with discrete optimization problems for points in Euclidean space, such as the minimum spanning tree, the traveling-salesman tour, and minimal-length matchings. Still, there are several nongeometric optimization problems that receive full treatment, and these include the problems of the longest common subsequence and the longest increasing subsequence. The philosophy that guides the exposition is that analysis of concrete problems is the most effective way to explain even the most general methods or abstract principles. There are three fundamental probabilistic themes that are examined through our concrete investigations. First, there is a systematic exploitation of martingales. Over the last ten years, many investigators of problems of combinatorial optimization have come to count on martingale inequalities as versatile tools which let us show that many of the naturally occurring random variables of combinatorial optimization are sharply concentrated about their means - a phenomenon with numerous practical and theoretical consequences. The second theme that is explored is the systematic use of subadditivity of several flavors, ranging from the naive subadditivity of real sequences to the subtler subadditivity of stochastic processes. By and large, subadditivity offers only elementary tools, but on remarkably many occasions such tools provide the key organizing principle in the attack on problems of nearly intractable difficulty. The third and deepest theme developed here concerns the application of Talagrand's isoperimetric theory of concentration inequalities. This new theory is reshaping almost everything that is known in the probability theory of combinatorial optimization. The treatment given here deals with only a small part of Talagrand's theory, but the reader will find considerable coaching on how to use some of the most important ideas from that theory.