Ten Lectures on the Probabilistic Method
Book information
Description
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 Lovász 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 encyclopedic--it 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.
Similar books
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
2007 · PDF
The Strange Logic of Random Graphs (Algorithms and Combinatorics, 22)
Asymptopia
2014 · PDF
Asymptopia
2014 · PDF
Discrete Probability and Algorithms
1995 · PDF
Ten Lectures on the Probabilictic Method
1994 · DJVU
Finite Model Theory and Its Applications
2007 · PDF
Ten Lectures on the Probabilistic Method
1987 · DJVU