· Introduction: The Nature of Probability Theory· The Sample Space· Elements of Combinatorial Analysis· Fluctuations in Coin Tossing and Random Walks· Combination of Events· Conditional Probability· Stochastic Independence· The Binomial and Poisson Distributions· The Normal Approximation to the Binomial Distribution· Unlimited Sequences of Bernoulli Trials· Random Variables· Expectation· Laws of Large Numbers· Integral Valued Variables· Generating Functions· Compound Distributions· Branching Processes· Recurrent Events· Renewal Theory· Random Walk and Ruin Problems· Markov Chains· Algebraic Treatment of Finite Markov Chains· The Simplest Time-Dependent Stochastic Processes

The theory of stochastic processes has developed so much in the last twenty years that the need for a systematic account of the subject has been felt, particularly by students and instructors of probability. This book fills that need. While even elementary definitions and theorems are stated in detail, this is not recommended as a first text in probability and there has been no compromise with the mathematics of probability. Since readers complained that omission of certain mathematical detail increased the obscurity of the subject, the text contains various mathematical points that might otherwise seem extraneous. A supplement includes a treatment of the various aspects of measure theory. A chapter on the specialized problem of prediction theory has also been included and references to the literature and historical remarks have been collected in the Appendix.

Quantum computers will break today's most popular public-key cryptographic systems, including RSA, DSA, and ECDSA. This book introduces the reader to the next generation of cryptographic algorithms, the systems that resist quantum-computer attacks: in particular, post-quantum public-key encryption systems and post-quantum public-key signature systems. Leading experts have joined forces for the first time to explain the state of the art in quantum computing, hash-based cryptography, code-based cryptography, lattice-based cryptography, and multivariate cryptography. Mathematical foundations and implementation issues are included. This book is an essential resource for students and researchers who want to contribute to the field of post-quantum cryptography.

This is the first volume of the Handbook of Game Theory with Economic Applications, to be followed by two additional volumes. Game Theory has developed greatly in the last decade, and today it is an essential tool in much of economic theory. The three volumes will cover the fundamental theoretical aspects, a wide range of applications to economics, several chapters on applications to political science, and individual chapters on relations with other disciplines. The topics covered in the present volume include chess-playing computers, an introduction to the non-cooperative theory, repeated games, bargaining theory, auctions, location, entry deterrence, patents, the cooperative theory and its applications, and the relation between Game Theory and ethics. For more information on the Handbooks in Economics series, please see our home page on http://www.elsevier.nl/locate/hes

Gini's mean difference (GMD) was first introduced by Corrado Gini in 1912 as an alternative measure of variability. GMD and the parameters which are derived from it (such as the Gini coefficient or the concentration ratio) have been in use in the area of income distribution for almost a century. In practice, the use of GMD as a measure of variability is justified whenever the investigator is not ready to impose, without questioning, the convenient world of normality. This makes the GMD of critical importance in the complex research of statisticians, economists, econometricians, and policy makers. This book focuses on imitating analyses that are based on variance by replacing variance with the GMD and its variants. In this way, the text showcases how almost everything that can be done with the variance as a measure of variability, can be replicated by using Gini. Beyond this, there are marked benefits to utilizing Gini as opposed to other methods. One of the advantages of using Gini methodology is that it provides a unified system that enables the user to learn about various aspects of the underlying distribution. It also provides a systematic method and a unified terminology. Using Gini methodology can reduce the risk of imposing assumptions that are not supported by the data on the model. With these benefits in mind the text uses the covariance-based approach, though applications to other approaches are mentioned as well.

This volume contains the original lecture notes presented by A. Weil in which the concept of adeles was first introduced, in conjunction with various aspects of C.L. Siegel’s work on quadratic forms. Serving as an introduction to the subject, these notes may also provide stimulation for further research.

From the reviews: “The first volume is devoted to ergodic theory and dynamical systems. It contains 19 papers divided into four groups ... . The reader will find a wealth of information and ideas that can still ignite inspiration and motivate students as well as senior researchers. The reader will also have a touch of Sinai’s personality, his taste, enthusiasm, and optimism, which are just as invaluable as his mathematical results.” (Nikolai Chernov, Mathematical Reviews, Issue 2012 e)

The starting point of this volume was a conference entitled "Progress in Mathematical Programming," held at the Asilomar Conference Center in Pacific Grove, California, March 1-4, 1987. The main topic of the conference was developments in the theory and practice of linear programming since Karmarkar's algorithm. There were thirty presentations and approximately fifty people attended. Presentations included new algorithms, new analyses of algorithms, reports on computational experience, and some other topics related to the practice of mathematical programming. Interestingly, most of the progress reported at the conference was on the theoretical side. Several new polynomial algorithms for linear program- ming were presented (Barnes-Chopra-Jensen, Goldfarb-Mehrotra, Gonzaga, Kojima-Mizuno-Yoshise, Renegar, Todd, Vaidya, and Ye). Other algorithms presented were by Betke-Gritzmann, Blum, Gill-Murray-Saunders-Wright, Nazareth, Vial, and Zikan-Cottle. Efforts in the theoretical analysis of algo- rithms were also reported (Anstreicher, Bayer-Lagarias, Imai, Lagarias, Megiddo-Shub, Lagarias, Smale, and Vanderbei). Computational experiences were reported by Lustig, Tomlin, Todd, Tone, Ye, and Zikan-Cottle. Of special interest, although not in the main direction discussed at the conference, was the report by Rinaldi on the practical solution of some large traveling salesman problems. At the time of the conference, it was still not clear whether the new algorithms developed since Karmarkar's algorithm would replace the simplex method in practice. Alan Hoffman presented results on conditions under which linear programming problems can be solved by greedy algorithms.

2013 Reprint of 1958 Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. A series of lectures on the role of nonlinear processes in physics, mathematics, electrical engineering, physiology, and communication theory. From the preface: "For some time I have been interested in a group of phenomena depending upon random processes. One the one hand, I have recorded the random shot effect as a suitable input for testing nonlinear circuits. On the other hand, for some of the work that Professor W. A. Rosenblith and I have been doing concerning the nature of the electroencephalogram, and in particular of the alpha rhythm, it has occurred to me to use the model of a system of random nonlinear oscillators excited by a random input. . . . At the beginning we had contemplated a series of only four or five lectures. My ideas developed pari passu with the course, and by the end of the term we found ourselves with a set of fifteen lectures. The last few of these were devoted to the application of my ideas to problems in the statistical mechanics of gases. This work is both new and tentative, and I found that I had to supplement my course by the writing over of these with the help of Professer Y. W. Lee. "

This book is about computational methods based on operator splitting. It consists of twenty-three chapters written by recognized splitting method contributors and practitioners, and covers a vast spectrum of topics and application areas, including computational mechanics, computational physics, image processing, wireless communication, nonlinear optics, and finance. Therefore, the book presents very versatile aspects of splitting methods and their applications, motivating the cross-fertilization of ideas.