The Probabilistic Method

The Probabilistic Method

by Noga Alon, Joel H. Spencer
     
 

View All Available Formats & Editions

Praise for the Second Edition:

"Serious researchers in combinatorics or algorithm design will wish to read the book in its entirety...the book may also be enjoyed on a lighter level since the different chapters are largely independent and so it is possible to pick out gems in one's own area..."
Formal Aspects of Computing

See more details below

Overview

Praise for the Second Edition:

"Serious researchers in combinatorics or algorithm design will wish to read the book in its entirety...the book may also be enjoyed on a lighter level since the different chapters are largely independent and so it is possible to pick out gems in one's own area..."
Formal Aspects of Computing

This Third Edition of The Probabilistic Method reflects the most recent developments in the field while maintaining the standard of excellence that established this book as the leading reference on probabilistic methods in combinatorics. Maintaining its clear writing style, illustrative examples, and practical exercises, this new edition emphasizes methodology, enabling readers to use probabilistic techniques for solving problems in such fields as theoretical computer science, mathematics, and statistical physics.

The book begins with a description of tools applied in probabilistic arguments, including basic techniques that use expectation and variance as well as the more recent applications of martingales and correlation inequalities. Next, the authors examine where probabilistic techniques have been applied successfully, exploring such topics as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Sections labeled "The Probabilistic Lens" offer additional insights into the application of the probabilistic approach, and the appendix has been updated to include methodologies for finding lower bounds for Large Deviations.

The Third Edition also features:

  • A new chapter on graph property testing, which is a current topic that incorporates combinatorial, probabilistic, and algorithmic techniques

  • An elementary approach using probabilistic techniques to the powerful Szemerédi Regularity Lemma and its applications

  • New sections devoted to percolation and liar games

  • A new chapter that provides a modern treatment of the Erdös-Rényi phase transition in the Random Graph Process

Written by two leading authorities in the field, The Probabilistic Method, Third Edition is an ideal reference for researchers in combinatorics and algorithm design who would like to better understand the use of probabilistic methods. The book's numerous exercises and examples also make it an excellent textbook for graduate-level courses in mathematics and computer science.

Read More

Editorial Reviews

Booknews
The probabilistic method has undergone intensive development in the wake of the increasing significance of randomness in theoretical computer science. This text features detailed descriptions of algorithmic techniques combined with a study of the classical method and the modern tools commonly applied in it. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Product Details

ISBN-13:
9781118210444
Publisher:
Wiley
Publication date:
09/20/2011
Series:
Wiley Series in Discrete Mathematics and Optimization , #73
Sold by:
Barnes & Noble
Format:
NOOK Book
Pages:
376
File size:
21 MB
Note:
This product may take a few minutes to download.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >