Library of Math
New and Used Math Books at Great Low Prices
Subscribe to the Library of Math Feed

The Probabilistic Method (Wiley-Interscience Series in Discrete Mathematics and Optimization)

The Probabilistic Method (Wiley-Interscience Series in Discrete Mathematics and Optimization)

enlarge enlarge 
Authors: Noga Alon, Joel H. Spencer
Publisher: Wiley-Interscience
Category: Book

List Price: $110.00
Buy New: $83.60
You Save: $26.40 (24%)



New (20) Used (8) from $83.60

Rating: 5.0 out of 5 stars 3 reviews
Sales Rank: 281546

Media: Hardcover
Edition: 3
Pages: 352
Number Of Items: 1
Shipping Weight (lbs): 1.4
Dimensions (in): 9.1 x 6.1 x 0.9

ISBN: 0470170204
Dewey Decimal Number: 511.6
EAN: 9780470170205

Publication Date: August 11, 2008
Availability: Usually ships in 1-2 business days
Shipping: International shipping available
Condition: Brand New, Perfect Condition, Please allow 4-14 business days for delivery. 100% Money Back Guarantee, Over 1,000,000 customers served.

Similar Items:

  • Random Graphs
  • Randomized Algorithms
  • Probability and Computing: Randomized Algorithms and Probabilistic Analysis
  • Approximation Algorithms
  • Combinatorial Problems and Exercises (AMS Chelsea Publishing) (AMS Chelsea Publishing)

Editorial Reviews:

Product Description
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 Szemeredi Regularity Lemma and its applications
  • New sections devoted to percolation and liar games
  • A new chapter that provides a modern treatment of the Erdos-Renyi 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.



Customer Reviews:

5 out of 5 stars Learn from the masters   July 3, 2001
Wonk (Philadelphia, PA USA)
22 out of 24 found this review helpful

This book shows you how to approach problems in discrete mathematics that don't seem to be probabilistic at all, and nonetheless to apply probabilistic methods to find extremely sharp results. The book is full of beautifully chosen examples worked out by the authors, who are world class researchers in this subject area. Should be on the bookshelf of everyone who uses discrete mathematics.


5 out of 5 stars A very interesting book   September 14, 2000
Todd Ebert (Long Beach California)
11 out of 13 found this review helpful

I found this book very enjoyable to read. Although the underlying theme of the book is to demonstrate examples of proofs of existence of a property of a finite structure by showing the structure must have the property with positive probabiltiy, the book goes beyond this to cover areas such as circuit complexity and discrepancy theory that rely heavily on probabilistic arguments. A must read for anyone who wants to add probablistic tools to their toolbox for proving things about discrete structures.


5 out of 5 stars Love, love, love this book...   September 8, 2005
anon (USA)
6 out of 7 found this review helpful

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 fields) which show the method coming to life. Can't recommend this enough...

 
about us contact us privacy policy terms of use mision statement lom help
The Library of Math - Online Math Organized by Subject Into Topics. © 2005 - 2008 www.LibraryOfMath.com All rights reserved. math rss