The probabilistic method
Author(s)
Bibliographic Information
The probabilistic method
(Wiley-Interscience series in discrete mathematics and optimization)
Wiley, c2000
2nd ed
Available at 33 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"A Wiley-Interscience publication."
Includes bibliographical references (p. 283-293) and indexes
Description and Table of Contents
Description
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 30 per cent new 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 he developer of the probabilistic method
Table of Contents
METHODS.The Basic Method.Linearity of Expectation.Alterations.The Second Moment.The Local Lemma.Correlation Inequalities.Martingales and Tight Concentration.The Poisson Paradigm.Pseudo--Randomness.TOPICS.Random Graphs.Circuit Complexity.Discrepancy.Geometry.Codes, Games and Entropy.Derandomization.Appendices.Indexes.References.
by "Nielsen BookData"