
1993 / x + 88 pages / Softcover / ISBN: 9780898713251 / List Price $50.50 / SIAM/CBMS Member Price $35.35 / Order Code CB64
This update of the 1987 title of the same name is an examination of what is currently known about the probabilistic method, written by one of its principal developers. Based on the notes from Spencer's 1986 series of ten lectures, this new edition contains an additional lecture: The Janson Inequalities. These inequalities allow accurate approximation of extremely small probabilities. A new algorithmic approach to the Lovasz Local Lemma, attributed to Jozsef Beck, has been added to Lecture 8, as well.
Throughout the monograph, Spencer retains the informal style of his original lecture notes and emphasizes the methodology, shunning the more technical "best possible" results in favor of clearer exposition. The book is not encyclopedicit contains only those examples that clearly display the methodology.
The probabilistic method is a powerful tool in graph theory, combinatorics, and theoretical computer science. It allows one to prove the existence of objects with certain properties (e.g., colorings) by showing that an appropriately defined random object has positive probability of having those properties.
Audience
Geared toward faculty and students in discrete mathematics and computer science, this monograph is ideal for use in a seminar. The only necessary background is a basic undergraduate course in probability or discrete mathematics.
Contents
The Probabilistic Method; The Deletion Method and Other Refinements; Random Graphs I; Large Deviations and Nonprobabilistic Algorithms; Discrepancy I; Chaos from Order; Random Graphs II; The Lovasz Local Lemma; Discrepancy II; Six Standard Deviations Suffice; The Janson Inequalities.
ISBN: 9780898713251