The Probabilistic Method, Second edition (Wiley-Interscience Series in Discrete Mathematics and Optimization)
β Scribed by Noga Alon
- Year
- 2000
- Tongue
- English
- Leaves
- 322
- Edition
- 2
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
The leading reference on probabilistic methods in combinatorics-now expanded and updated When it was first published in 1991, The Probabilistic Method became instantly the standard reference on one of the most powerful and widely used tools in combinatorics. Still without competition nearly a decade later, this new edition brings you up to speed on recent developments, while adding useful exercises and over 30ew material. It continues to emphasize the basic elements of the methodology, discussing in a remarkably clear and informal style both algorithmic and classical methods as well as modern applications. The Probabilistic Method, Second Edition begins with basic techniques that use expectation and variance, as well as the more recent martingales and correlation inequalities, then explores areas where probabilistic techniques proved successful, including discrepancy and random graphs as well as cutting-edge topics in theoretical computer science. A series of proofs, or "probabilistic lenses," are interspersed throughout the book, offering added insight into the application of the probabilistic approach. New and revised coverage includes: * Several improved as well as new results * A continuous approach to discrete probabilistic problems * Talagrand's Inequality and other novel concentration results * A discussion of the connection between discrepancy and VC-dimension * Several combinatorial applications of the entropy function and its properties * A new section on the life and work of Paul Erd?s-the developer of the probabilistic method
π SIMILAR VOLUMES
I happen to love studying probability theory and the probabilistic method and this is the book I come to time and time again. It is well organized and provides great, straightforward, insightful explanations. However, its main strength is its wealth of beautiful (fairly recently) results (in varied
A mathematical gemβfreshly cleaned and polishedThis book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create
Describes the combinatorial analysis of data using trees as the model, and the use of this model in representing proximities. This technique is of great importance in many applications including such fields as computer science, decision theory, artificial intelligence, information theory, experiment
There is no question that combinatorics is becoming more important in the practice of computer science. While some of the most important techniques are covered in discrete mathematics courses, there is not enough breadth or depth in the coverage. As a consequence, one of my goals this upcoming year
<span>Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION<br> <br> "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with mor